Base | Representation |
---|---|
bin | 1110100110100101010010… |
… | …01000111111001011100001 |
3 | 11012200212201102011021020002 |
4 | 13103102221020333023201 |
5 | 13202110400340212322 |
6 | 152144015532025345 |
7 | 6523005423436514 |
oct | 723225110771341 |
9 | 135625642137202 |
10 | 32112013210337 |
11 | a2606a0331745 |
12 | 3727634302255 |
13 | 14bc1c42c1728 |
14 | 7d0330556d7b |
15 | 3aa4919c0c92 |
hex | 1d34a923f2e1 |
32112013210337 has 2 divisors, whose sum is σ = 32112013210338. Its totient is φ = 32112013210336.
The previous prime is 32112013210289. The next prime is 32112013210339. The reversal of 32112013210337 is 73301231021123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22494379494976 + 9617633715361 = 4742824^2 + 3101231^2 .
It is a cyclic number.
It is not a de Polignac number, because 32112013210337 - 212 = 32112013206241 is a prime.
Together with 32112013210339, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (32112013210339) 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, 16056006605168 + 16056006605169.
It is an arithmetic number, because the mean of its divisors is an integer number (16056006605169).
Almost surely, 232112013210337 is an apocalyptic number.
It is an amenable number.
32112013210337 is a deficient number, since it is larger than the sum of its proper divisors (1).
32112013210337 is an equidigital number, since it uses as much as digits as its factorization.
32112013210337 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 29.
The spelling of 32112013210337 in words is "thirty-two trillion, one hundred twelve billion, thirteen million, two hundred ten thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •