Base | Representation |
---|---|
bin | 1110100111000111010111… |
… | …10101010101110111011101 |
3 | 11012202121221200120020210001 |
4 | 13103203223311111313131 |
5 | 13202410334333044122 |
6 | 152200243410414301 |
7 | 6524224040552413 |
oct | 723435365256735 |
9 | 135677850506701 |
10 | 32130312003037 |
11 | a268430543516 |
12 | 372b0a0591391 |
13 | 14c0b4c3b9411 |
14 | 7d11889212b3 |
15 | 3aabb31ea527 |
hex | 1d38ebd55ddd |
32130312003037 has 2 divisors, whose sum is σ = 32130312003038. Its totient is φ = 32130312003036.
The previous prime is 32130312002993. The next prime is 32130312003043. The reversal of 32130312003037 is 73030021303123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24522363424036 + 7607948579001 = 4952006^2 + 2758251^2 .
It is a cyclic number.
It is not a de Polignac number, because 32130312003037 - 235 = 32095952264669 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32130312002996 and 32130312003014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32130312001037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16065156001518 + 16065156001519.
It is an arithmetic number, because the mean of its divisors is an integer number (16065156001519).
Almost surely, 232130312003037 is an apocalyptic number.
It is an amenable number.
32130312003037 is a deficient number, since it is larger than the sum of its proper divisors (1).
32130312003037 is an equidigital number, since it uses as much as digits as its factorization.
32130312003037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 28.
The spelling of 32130312003037 in words is "thirty-two trillion, one hundred thirty billion, three hundred twelve million, three thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •