Base | Representation |
---|---|
bin | 11101000011101011… |
… | …010111100010000111 |
3 | 2222112101201001021011 |
4 | 131003223113202013 |
5 | 1002344223310002 |
6 | 22155544503051 |
7 | 2153112302326 |
oct | 350353274207 |
9 | 88471631234 |
10 | 31200213127 |
11 | 12260785a06 |
12 | 6068a7aa87 |
13 | 2c32c32595 |
14 | 171d9d20bd |
15 | c291a78d7 |
hex | 743ad7887 |
31200213127 has 2 divisors, whose sum is σ = 31200213128. Its totient is φ = 31200213126.
The previous prime is 31200213119. The next prime is 31200213137. The reversal of 31200213127 is 72131200213.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 31200213127 - 23 = 31200213119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31200213098 and 31200213107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31200213137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15600106563 + 15600106564.
It is an arithmetic number, because the mean of its divisors is an integer number (15600106564).
Almost surely, 231200213127 is an apocalyptic number.
31200213127 is a deficient number, since it is larger than the sum of its proper divisors (1).
31200213127 is an equidigital number, since it uses as much as digits as its factorization.
31200213127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 22.
The spelling of 31200213127 in words is "thirty-one billion, two hundred million, two hundred thirteen thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •