Base | Representation |
---|---|
bin | 110000010000011001011001… |
… | …001111100101011000001111 |
3 | 1000211110021111110102200022021 |
4 | 300100121121033211120033 |
5 | 210304211201333101111 |
6 | 2031214255510431011 |
7 | 62463220603125052 |
oct | 6020313117453017 |
9 | 1024407443380267 |
10 | 212233011222031 |
11 | 61695572a28028 |
12 | 1b97821a062467 |
13 | 91566441760b7 |
14 | 3a5a1bda16a99 |
15 | 1980a035bbd71 |
hex | c106593e560f |
212233011222031 has 2 divisors, whose sum is σ = 212233011222032. Its totient is φ = 212233011222030.
The previous prime is 212233011222007. The next prime is 212233011222047. The reversal of 212233011222031 is 130222110332212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212233011222031 - 221 = 212233009124879 is a prime.
It is a super-2 number, since 2×2122330112220312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212233011221987 and 212233011222005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212233011222731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106116505611015 + 106116505611016.
It is an arithmetic number, because the mean of its divisors is an integer number (106116505611016).
Almost surely, 2212233011222031 is an apocalyptic number.
212233011222031 is a deficient number, since it is larger than the sum of its proper divisors (1).
212233011222031 is an equidigital number, since it uses as much as digits as its factorization.
212233011222031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 212233011222031 its reverse (130222110332212), we get a palindrome (342455121554243).
The spelling of 212233011222031 in words is "two hundred twelve trillion, two hundred thirty-three billion, eleven million, two hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •