Base | Representation |
---|---|
bin | 1110100011010100101010… |
… | …10110010001101011011001 |
3 | 11012022011121212010021022012 |
4 | 13101222111112101223121 |
5 | 13143242011032444321 |
6 | 152020334053235305 |
7 | 6511632062033465 |
oct | 721522526215331 |
9 | 135264555107265 |
10 | 32000011999961 |
11 | a218146598665 |
12 | 3709997332b35 |
13 | 14b1785315595 |
14 | 7c8b476814a5 |
15 | 3a75d8d7705b |
hex | 1d1a95591ad9 |
32000011999961 has 2 divisors, whose sum is σ = 32000011999962. Its totient is φ = 32000011999960.
The previous prime is 32000011999931. The next prime is 32000012000023. The reversal of 32000011999961 is 16999911000023.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19670608744336 + 12329403255625 = 4435156^2 + 3511325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32000011999961 is a prime.
It is not a weakly prime, because it can be changed into another prime (32000011999931) 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, 16000005999980 + 16000005999981.
It is an arithmetic number, because the mean of its divisors is an integer number (16000005999981).
Almost surely, 232000011999961 is an apocalyptic number.
It is an amenable number.
32000011999961 is a deficient number, since it is larger than the sum of its proper divisors (1).
32000011999961 is an equidigital number, since it uses as much as digits as its factorization.
32000011999961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 236196, while the sum is 50.
Adding to 32000011999961 its reverse (16999911000023), we get a palindrome (48999922999984).
The spelling of 32000011999961 in words is "thirty-two trillion, eleven million, nine hundred ninety-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •