Creating implementation for idiom 308 : Integer to string in base b

Idiom

# 308 Integer to string in base b

Created by

Lead paragraph

Create the string representation s of the integer value n in base b.

18 in base 3 -> "200"
26 in base 5 -> "101"
121 in base 12 -> "a1"

New implementation

Language

Imports

Code

Documentation URL

Original attribution URL

Online runnable demo

Username

Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating material.

Please try to avoid dependencies to third-party libraries and frameworks.

Other implementations

import "strconv"

s := strconv.FormatInt(int64(n), b)

Demo
Doc

let s = n.toString(b);

Demo
Doc

String s = Integer.toString(n, b);

uses math;

function IntToBaseStr(n: longword; const b: cardinal): string;
const
  digits = '0123456789abcdefghijklmnopqrstuvwxyz';
var
  remainder: longword;
begin
  Result := '';
  repeat
    DivMod(n, b, n, remainder);
    result := digits[remainder + 1] + result;
  until n = 0;
end;

uses fsiconv;

s := IntToStrBase(n,b);

Doc
Origin

sub int_to_base_str {
    my ($n, $b) = @_;
    my $digits = '0123456789abcdefghijklmnopqrstuvwxyz';
    my ($s, $q, $remainder) = ('');

    return '0' if $n == 0;

    use integer;

    while ($n) {
        ($n, $remainder) = ($n / $b, $n % $b), 
        $s = substr($digits, $remainder, 1) . $s;
    }

    return $s
}

Demo

def int_to_base_str(n, b):
    digits = '0123456789abcdefghijklmnopqrstuvwxyz'
    s = ''
    if n == 0: return '0'
    while n:
        n, remainder = divmod(n, b)
        s = digits[remainder] + s
    return s

import numpy

s = numpy.base_repr(n, b)

from string import digits, ascii_letters

a, s = digits + ascii_letters, ''
while n:
    s = a[n % b] + s
    n = n // b

from string import printable

a, s = printable.rstrip(), ''
while n:
    s = a[n % b] + s
    n = n // b

s = n.to_s(b)

Demo
Doc

use radix_fmt::radix;

let s = radix(n, b);

Preview