Base | Representation |
---|---|
bin | 110010011110100010101001… |
… | …111110000011011110101011 |
3 | 1002010001002200211200220100212 |
4 | 302132202221332003132223 |
5 | 213044231244012243311 |
6 | 2104053523540051335 |
7 | 64522023511106216 |
oct | 6236425176033653 |
9 | 1063032624626325 |
10 | 222001121212331 |
11 | 6481116840462a |
12 | 20a9537a393b4b |
13 | 96b48011a3b16 |
14 | 3cb6ca95d277d |
15 | 1a9eb5a578c8b |
hex | c9e8a9f837ab |
222001121212331 has 2 divisors, whose sum is σ = 222001121212332. Its totient is φ = 222001121212330.
The previous prime is 222001121212301. The next prime is 222001121212399. The reversal of 222001121212331 is 133212121100222.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 222001121212331 - 214 = 222001121195947 is a prime.
It is a super-2 number, since 2×2220011212123312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 222001121212297 and 222001121212306.
It is not a weakly prime, because it can be changed into another prime (222001121212301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111000560606165 + 111000560606166.
It is an arithmetic number, because the mean of its divisors is an integer number (111000560606166).
Almost surely, 2222001121212331 is an apocalyptic number.
222001121212331 is a deficient number, since it is larger than the sum of its proper divisors (1).
222001121212331 is an equidigital number, since it uses as much as digits as its factorization.
222001121212331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 222001121212331 its reverse (133212121100222), we get a palindrome (355213242312553).
The spelling of 222001121212331 in words is "two hundred twenty-two trillion, one billion, one hundred twenty-one million, two hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •