Base | Representation |
---|---|
bin | 1110000110001110100110… |
… | …01011101100000110001101 |
3 | 11001202121020202002002211202 |
4 | 13003013103023230012031 |
5 | 13030402124420011023 |
6 | 145533203515555245 |
7 | 6346461610356125 |
oct | 703072313540615 |
9 | 131677222062752 |
10 | 31000322032013 |
11 | 9972187679404 |
12 | 35880a115bb25 |
13 | 143b41934ab79 |
14 | 7925d049dc85 |
15 | 38b5c9952128 |
hex | 1c31d32ec18d |
31000322032013 has 2 divisors, whose sum is σ = 31000322032014. Its totient is φ = 31000322032012.
The previous prime is 31000322031949. The next prime is 31000322032019. The reversal of 31000322032013 is 31023022300013.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15763337674249 + 15236984357764 = 3970307^2 + 3903458^2 .
It is a cyclic number.
It is not a de Polignac number, because 31000322032013 - 26 = 31000322031949 is a prime.
It is a super-2 number, since 2×310003220320132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31000322032019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15500161016006 + 15500161016007.
It is an arithmetic number, because the mean of its divisors is an integer number (15500161016007).
Almost surely, 231000322032013 is an apocalyptic number.
It is an amenable number.
31000322032013 is a deficient number, since it is larger than the sum of its proper divisors (1).
31000322032013 is an equidigital number, since it uses as much as digits as its factorization.
31000322032013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 31000322032013 its reverse (31023022300013), we get a palindrome (62023344332026).
The spelling of 31000322032013 in words is "thirty-one trillion, three hundred twenty-two million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •