Base | Representation |
---|---|
bin | 1110101000000111000100… |
… | …11111011010111011110101 |
3 | 11012212220020100112112011022 |
4 | 13110003202133122323311 |
5 | 13203440411320000203 |
6 | 152224101343350525 |
7 | 6526544444334032 |
oct | 724034237327365 |
9 | 135786210475138 |
10 | 32164515000053 |
11 | a2809922103a7 |
12 | 3735846bb2445 |
13 | 14c41404693a7 |
14 | 7d2ab1242389 |
15 | 3aba15ce6a38 |
hex | 1d40e27daef5 |
32164515000053 has 2 divisors, whose sum is σ = 32164515000054. Its totient is φ = 32164515000052.
The previous prime is 32164515000049. The next prime is 32164515000067. The reversal of 32164515000053 is 35000051546123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16228594711729 + 15935920288324 = 4028473^2 + 3991982^2 .
It is a cyclic number.
It is not a de Polignac number, because 32164515000053 - 22 = 32164515000049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32164514999977 and 32164515000022.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32164515006053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16082257500026 + 16082257500027.
It is an arithmetic number, because the mean of its divisors is an integer number (16082257500027).
Almost surely, 232164515000053 is an apocalyptic number.
It is an amenable number.
32164515000053 is a deficient number, since it is larger than the sum of its proper divisors (1).
32164515000053 is an equidigital number, since it uses as much as digits as its factorization.
32164515000053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 32164515000053 its reverse (35000051546123), we get a palindrome (67164566546176).
The spelling of 32164515000053 in words is "thirty-two trillion, one hundred sixty-four billion, five hundred fifteen million, fifty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •