Base | Representation |
---|---|
bin | 101101111101000101101000… |
… | …000100010001110111111111 |
3 | 222111121112021221021121102002 |
4 | 231331011220010101313333 |
5 | 202442332311113001002 |
6 | 1553504021243452515 |
7 | 60366652520352413 |
oct | 5575055004216777 |
9 | 874545257247362 |
10 | 202110022000127 |
11 | 5944241947026a |
12 | 1a80233952713b |
13 | 88a0b7c753a77 |
14 | 37ca26a582d43 |
15 | 185752b05d002 |
hex | b7d168111dff |
202110022000127 has 2 divisors, whose sum is σ = 202110022000128. Its totient is φ = 202110022000126.
The previous prime is 202110022000099. The next prime is 202110022000169. The reversal of 202110022000127 is 721000220011202.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 202110022000127 - 26 = 202110022000063 is a prime.
It is a super-2 number, since 2×2021100220001272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202110022000099 and 202110022000108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202110022008127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101055011000063 + 101055011000064.
It is an arithmetic number, because the mean of its divisors is an integer number (101055011000064).
Almost surely, 2202110022000127 is an apocalyptic number.
202110022000127 is a deficient number, since it is larger than the sum of its proper divisors (1).
202110022000127 is an equidigital number, since it uses as much as digits as its factorization.
202110022000127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 202110022000127 its reverse (721000220011202), we get a palindrome (923110242011329).
The spelling of 202110022000127 in words is "two hundred two trillion, one hundred ten billion, twenty-two million, one hundred twenty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •