Base | Representation |
---|---|
bin | 11110000010010011101110… |
… | …001011000011001110001011 |
3 | 122022201122012211101001111201 |
4 | 132002103232023003032023 |
5 | 114303311310031424323 |
6 | 1144541523513005031 |
7 | 36552624252351103 |
oct | 3602235613031613 |
9 | 568648184331451 |
10 | 132100010029963 |
11 | 39100332904838 |
12 | 12995a4a0b3777 |
13 | 5892c9272b381 |
14 | 2489963160203 |
15 | 10413575e28ad |
hex | 7824ee2c338b |
132100010029963 has 2 divisors, whose sum is σ = 132100010029964. Its totient is φ = 132100010029962.
The previous prime is 132100010029943. The next prime is 132100010029991. The reversal of 132100010029963 is 369920010001231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 132100010029963 - 221 = 132100007932811 is a prime.
It is not a weakly prime, because it can be changed into another prime (132100010029943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66050005014981 + 66050005014982.
It is an arithmetic number, because the mean of its divisors is an integer number (66050005014982).
Almost surely, 2132100010029963 is an apocalyptic number.
132100010029963 is a deficient number, since it is larger than the sum of its proper divisors (1).
132100010029963 is an equidigital number, since it uses as much as digits as its factorization.
132100010029963 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 37.
The spelling of 132100010029963 in words is "one hundred thirty-two trillion, one hundred billion, ten million, twenty-nine thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •