Base | Representation |
---|---|
bin | 1001010001110010000100… |
… | …0100101010110100111111 |
3 | 1100010012211100111111122201 |
4 | 2110130201010222310333 |
5 | 2314113324130401002 |
6 | 33410153251052331 |
7 | 2102001552006616 |
oct | 224344104526477 |
9 | 40105740444581 |
10 | 10201102200127 |
11 | 3283299282513 |
12 | 11890605a10a7 |
13 | 58cc62918907 |
14 | 273a4376287d |
15 | 12a54a035087 |
hex | 9472112ad3f |
10201102200127 has 2 divisors, whose sum is σ = 10201102200128. Its totient is φ = 10201102200126.
The previous prime is 10201102200077. The next prime is 10201102200239. The reversal of 10201102200127 is 72100220110201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10201102200127 - 243 = 1405009177919 is a prime.
It is a super-2 number, since 2×102011022001272 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10201102000127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100551100063 + 5100551100064.
It is an arithmetic number, because the mean of its divisors is an integer number (5100551100064).
Almost surely, 210201102200127 is an apocalyptic number.
10201102200127 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201102200127 is an equidigital number, since it uses as much as digits as its factorization.
10201102200127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 19.
Adding to 10201102200127 its reverse (72100220110201), we get a palindrome (82301322310328).
The spelling of 10201102200127 in words is "ten trillion, two hundred one billion, one hundred two million, two hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •