Base | Representation |
---|---|
bin | 110010011110100001101110… |
… | …010111011001001110001111 |
3 | 1002010001000010011001010120002 |
4 | 302132201232113121032033 |
5 | 213044222222013101111 |
6 | 2104053240414514515 |
7 | 64521656646245465 |
oct | 6236415627311617 |
9 | 1063030104033502 |
10 | 222000121222031 |
11 | 648107a4998069 |
12 | 20a9513b505a3b |
13 | 96b46a1c6b199 |
14 | 3cb6c12888835 |
15 | 1a9eaec89a63b |
hex | c9e86e5d938f |
222000121222031 has 2 divisors, whose sum is σ = 222000121222032. Its totient is φ = 222000121222030.
The previous prime is 222000121222007. The next prime is 222000121222127. The reversal of 222000121222031 is 130222121000222.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 222000121222031 - 214 = 222000121205647 is a prime.
It is a super-2 number, since 2×2220001212220312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222000121221994 and 222000121222012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222000121222331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111000060611015 + 111000060611016.
It is an arithmetic number, because the mean of its divisors is an integer number (111000060611016).
Almost surely, 2222000121222031 is an apocalyptic number.
222000121222031 is a deficient number, since it is larger than the sum of its proper divisors (1).
222000121222031 is an equidigital number, since it uses as much as digits as its factorization.
222000121222031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 222000121222031 its reverse (130222121000222), we get a palindrome (352222242222253).
The spelling of 222000121222031 in words is "two hundred twenty-two trillion, one hundred twenty-one million, two hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •