Base | Representation |
---|---|
bin | 1100010110100101011… |
… | …1101111111110110111 |
3 | 202021210001200112202202 |
4 | 3011221113233332313 |
5 | 11434112113343111 |
6 | 241254301255115 |
7 | 21222016462115 |
oct | 3055127577667 |
9 | 667701615682 |
10 | 212221231031 |
11 | 82003396a37 |
12 | 3516856449b |
13 | 17021262824 |
14 | a3b324aab5 |
15 | 57c1344b3b |
hex | 31695effb7 |
212221231031 has 2 divisors, whose sum is σ = 212221231032. Its totient is φ = 212221231030.
The previous prime is 212221231021. The next prime is 212221231051. The reversal of 212221231031 is 130132122212.
It is an a-pointer prime, because the next prime (212221231051) can be obtained adding 212221231031 to its sum of digits (20).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 212221231031 - 210 = 212221230007 is a prime.
It is a super-2 number, since 2×2122212310312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 212221230994 and 212221231012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212221231021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106110615515 + 106110615516.
It is an arithmetic number, because the mean of its divisors is an integer number (106110615516).
Almost surely, 2212221231031 is an apocalyptic number.
212221231031 is a deficient number, since it is larger than the sum of its proper divisors (1).
212221231031 is an equidigital number, since it uses as much as digits as its factorization.
212221231031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 212221231031 its reverse (130132122212), we get a palindrome (342353353243).
The spelling of 212221231031 in words is "two hundred twelve billion, two hundred twenty-one million, two hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •