Base | Representation |
---|---|
bin | 11101000100111110… |
… | …011110110111101011 |
3 | 2222120220200222210021 |
4 | 131010332132313223 |
5 | 1002420313014011 |
6 | 22202043501311 |
7 | 2153465426236 |
oct | 350476366753 |
9 | 88526628707 |
10 | 31222001131 |
11 | 12272007622 |
12 | 6074227837 |
13 | 2c375c07a9 |
14 | 172286441d |
15 | c2b05d471 |
hex | 744f9edeb |
31222001131 has 2 divisors, whose sum is σ = 31222001132. Its totient is φ = 31222001130.
The previous prime is 31222001119. The next prime is 31222001147. The reversal of 31222001131 is 13110022213.
It is an a-pointer prime, because the next prime (31222001147) can be obtained adding 31222001131 to its sum of digits (16).
It is a weak prime.
It is an emirp because it is prime and its reverse (13110022213) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-31222001131 is a prime.
It is a super-2 number, since 2×312220011312 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (31222005131) 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, 15611000565 + 15611000566.
It is an arithmetic number, because the mean of its divisors is an integer number (15611000566).
Almost surely, 231222001131 is an apocalyptic number.
31222001131 is a deficient number, since it is larger than the sum of its proper divisors (1).
31222001131 is an equidigital number, since it uses as much as digits as its factorization.
31222001131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 31222001131 its reverse (13110022213), we get a palindrome (44332023344).
The spelling of 31222001131 in words is "thirty-one billion, two hundred twenty-two million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •