Base | Representation |
---|---|
bin | 1100111011000001001… |
… | …1000100101101001111 |
3 | 210020000122021111020111 |
4 | 3032300103010231033 |
5 | 12114124241402002 |
6 | 245552542300451 |
7 | 22016252255131 |
oct | 3166023045517 |
9 | 706018244214 |
10 | 222001122127 |
11 | 86171933964 |
12 | 37037887727 |
13 | 17c1c474b35 |
14 | aa60075051 |
15 | 5b94c253d7 |
hex | 33b04c4b4f |
222001122127 has 2 divisors, whose sum is σ = 222001122128. Its totient is φ = 222001122126.
The previous prime is 222001122107. The next prime is 222001122131. The reversal of 222001122127 is 721221100222.
222001122127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 222001122127 - 219 = 222000597839 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 222001122098 and 222001122107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (222001122107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 111000561063 + 111000561064.
It is an arithmetic number, because the mean of its divisors is an integer number (111000561064).
Almost surely, 2222001122127 is an apocalyptic number.
222001122127 is a deficient number, since it is larger than the sum of its proper divisors (1).
222001122127 is an equidigital number, since it uses as much as digits as its factorization.
222001122127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 222001122127 its reverse (721221100222), we get a palindrome (943222222349).
The spelling of 222001122127 in words is "two hundred twenty-two billion, one million, one hundred twenty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •