Base | Representation |
---|---|
bin | 1001000110101100001101… |
… | …00100010001011010101111 |
3 | 2121212222221220020211221011 |
4 | 10203112012210101122233 |
5 | 10111011203124102002 |
6 | 110325322205050051 |
7 | 4134322345655314 |
oct | 443260644213257 |
9 | 77788856224834 |
10 | 20021100222127 |
11 | 64199a0143244 |
12 | 22b4281b56927 |
13 | b22c9b8b9484 |
14 | 4d30526dcd0b |
15 | 24abdc4cd8d7 |
hex | 1235869116af |
20021100222127 has 2 divisors, whose sum is σ = 20021100222128. Its totient is φ = 20021100222126.
The previous prime is 20021100222037. The next prime is 20021100222143. The reversal of 20021100222127 is 72122200112002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20021100222127 - 227 = 20020966004399 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20021100222098 and 20021100222107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20021100222157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010550111063 + 10010550111064.
It is an arithmetic number, because the mean of its divisors is an integer number (10010550111064).
Almost surely, 220021100222127 is an apocalyptic number.
20021100222127 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021100222127 is an equidigital number, since it uses as much as digits as its factorization.
20021100222127 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 20021100222127 its reverse (72122200112002), we get a palindrome (92143300334129).
The spelling of 20021100222127 in words is "twenty trillion, twenty-one billion, one hundred million, two hundred twenty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •