Base | Representation |
---|---|
bin | 11101011010011000111… |
… | …010100100100100111111 |
3 | 21011020001220121112112102 |
4 | 131122120322210210333 |
5 | 231103404212321002 |
6 | 4144305421055315 |
7 | 266012136360326 |
oct | 35323072444477 |
9 | 7136056545472 |
10 | 2021200120127 |
11 | 70a205858921 |
12 | 28787b9b753b |
13 | 1187a1776056 |
14 | 6db802d70bd |
15 | 378992a9a02 |
hex | 1d698ea493f |
2021200120127 has 2 divisors, whose sum is σ = 2021200120128. Its totient is φ = 2021200120126.
The previous prime is 2021200120117. The next prime is 2021200120133. The reversal of 2021200120127 is 7210210021202.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2021200120127 - 232 = 2016905152831 is a prime.
It is a super-2 number, since 2×20212001201272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2021200120099 and 2021200120108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2021200120117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1010600060063 + 1010600060064.
It is an arithmetic number, because the mean of its divisors is an integer number (1010600060064).
Almost surely, 22021200120127 is an apocalyptic number.
2021200120127 is a deficient number, since it is larger than the sum of its proper divisors (1).
2021200120127 is an equidigital number, since it uses as much as digits as its factorization.
2021200120127 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 2021200120127 its reverse (7210210021202), we get a palindrome (9231410141329).
The spelling of 2021200120127 in words is "two trillion, twenty-one billion, two hundred million, one hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •