Base | Representation |
---|---|
bin | 1110100011010100101100… |
… | …10011010011111100010111 |
3 | 11012022011122222020011021002 |
4 | 13101222112103103330113 |
5 | 13143242024132000043 |
6 | 152020335424213515 |
7 | 6511632345033056 |
oct | 721522623237427 |
9 | 135264588204232 |
10 | 32000028000023 |
11 | a218154626756 |
12 | 37099a076a29b |
13 | 14b1788728185 |
14 | 7c8b4984839d |
15 | 3a75da487bb8 |
hex | 1d1a964d3f17 |
32000028000023 has 2 divisors, whose sum is σ = 32000028000024. Its totient is φ = 32000028000022.
The previous prime is 32000027999993. The next prime is 32000028000053. The reversal of 32000028000023 is 32000082000023.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (32000027999993) and next prime (32000028000053).
It is a cyclic number.
It is not a de Polignac number, because 32000028000023 - 26 = 32000027999959 is a prime.
It is a super-3 number, since 3×320000280000233 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32000027999959 and 32000028000004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32000028000053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16000014000011 + 16000014000012.
It is an arithmetic number, because the mean of its divisors is an integer number (16000014000012).
Almost surely, 232000028000023 is an apocalyptic number.
32000028000023 is a deficient number, since it is larger than the sum of its proper divisors (1).
32000028000023 is an equidigital number, since it uses as much as digits as its factorization.
32000028000023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 20.
The spelling of 32000028000023 in words is "thirty-two trillion, twenty-eight million, twenty-three", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •