Base | Representation |
---|---|
bin | 110010000001011101000001… |
… | …000011000010110101111111 |
3 | 1001211222000010122220001101211 |
4 | 302001131001003002311333 |
5 | 212314004001441321002 |
6 | 2055523341013145251 |
7 | 64224430430502316 |
oct | 6201350103026577 |
9 | 1054860118801354 |
10 | 220002201120127 |
11 | 641104560a5528 |
12 | 20811a9802b227 |
13 | 959b1705a705a |
14 | 3c4824033127d |
15 | 1a67b672b3dd7 |
hex | c817410c2d7f |
220002201120127 has 2 divisors, whose sum is σ = 220002201120128. Its totient is φ = 220002201120126.
The previous prime is 220002201120109. The next prime is 220002201120193. The reversal of 220002201120127 is 721021102200022.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 220002201120127 - 27 = 220002201119999 is a prime.
It is a super-2 number, since 2×2200022011201272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 220002201120098 and 220002201120107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220002201129127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110001100560063 + 110001100560064.
It is an arithmetic number, because the mean of its divisors is an integer number (110001100560064).
Almost surely, 2220002201120127 is an apocalyptic number.
220002201120127 is a deficient number, since it is larger than the sum of its proper divisors (1).
220002201120127 is an equidigital number, since it uses as much as digits as its factorization.
220002201120127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 448, while the sum is 22.
Adding to 220002201120127 its reverse (721021102200022), we get a palindrome (941023303320149).
The spelling of 220002201120127 in words is "two hundred twenty trillion, two billion, two hundred one million, one hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •