Base | Representation |
---|---|
bin | 1110100011101011001101… |
… | …00001000100101111110001 |
3 | 11012100022212001220111001212 |
4 | 13101311212201010233301 |
5 | 13143441300432001223 |
6 | 152030054425205505 |
7 | 6512540646414023 |
oct | 721654641045761 |
9 | 135308761814055 |
10 | 32012111203313 |
11 | a22229524717a |
12 | 37101b3330895 |
13 | 14b2962ba20c7 |
14 | 7c9574524013 |
15 | 3a7a96191278 |
hex | 1d1d66844bf1 |
32012111203313 has 2 divisors, whose sum is σ = 32012111203314. Its totient is φ = 32012111203312.
The previous prime is 32012111203291. The next prime is 32012111203363. The reversal of 32012111203313 is 31330211121023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26347863522289 + 5664247681024 = 5133017^2 + 2379968^2 .
It is a cyclic number.
It is not a de Polignac number, because 32012111203313 - 28 = 32012111203057 is a prime.
It is not a weakly prime, because it can be changed into another prime (32012111203363) 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, 16006055601656 + 16006055601657.
It is an arithmetic number, because the mean of its divisors is an integer number (16006055601657).
Almost surely, 232012111203313 is an apocalyptic number.
It is an amenable number.
32012111203313 is a deficient number, since it is larger than the sum of its proper divisors (1).
32012111203313 is an equidigital number, since it uses as much as digits as its factorization.
32012111203313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 32012111203313 its reverse (31330211121023), we get a palindrome (63342322324336).
The spelling of 32012111203313 in words is "thirty-two trillion, twelve billion, one hundred eleven million, two hundred three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •