Base | Representation |
---|---|
bin | 1100011010010011110… |
… | …1100111101000001111 |
3 | 202101100201221210012202 |
4 | 3012210331213220033 |
5 | 11443134034422111 |
6 | 241541414152115 |
7 | 21255546500264 |
oct | 3064475475017 |
9 | 671321853182 |
10 | 213221014031 |
11 | 82476781783 |
12 | 353a735263b |
13 | 17150424cbc |
14 | a469d3d26b |
15 | 582ded1b3b |
hex | 31a4f67a0f |
213221014031 has 2 divisors, whose sum is σ = 213221014032. Its totient is φ = 213221014030.
The previous prime is 213221014003. The next prime is 213221014051. The reversal of 213221014031 is 130410122312.
It is an a-pointer prime, because the next prime (213221014051) can be obtained adding 213221014031 to its sum of digits (20).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213221014031 is a prime.
It is a super-2 number, since 2×2132210140312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 213221013994 and 213221014012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213221014051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106610507015 + 106610507016.
It is an arithmetic number, because the mean of its divisors is an integer number (106610507016).
Almost surely, 2213221014031 is an apocalyptic number.
213221014031 is a deficient number, since it is larger than the sum of its proper divisors (1).
213221014031 is an equidigital number, since it uses as much as digits as its factorization.
213221014031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 213221014031 its reverse (130410122312), we get a palindrome (343631136343).
The spelling of 213221014031 in words is "two hundred thirteen billion, two hundred twenty-one million, fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •