Base | Representation |
---|---|
bin | 100000001011001111111… |
… | …001110001110100011111 |
3 | 21211101020110000221121111 |
4 | 200023033321301310133 |
5 | 242211313403021002 |
6 | 4411433232442451 |
7 | 315514102161232 |
oct | 40131771616437 |
9 | 7741213027544 |
10 | 2211101220127 |
11 | 7827a4aa4a78 |
12 | 2b86393a9427 |
13 | 13067675ab47 |
14 | 7903706d419 |
15 | 3c7b0d373d7 |
hex | 202cfe71d1f |
2211101220127 has 2 divisors, whose sum is σ = 2211101220128. Its totient is φ = 2211101220126.
The previous prime is 2211101220109. The next prime is 2211101220131. The reversal of 2211101220127 is 7210221011122.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2211101220127 is a prime.
It is a super-2 number, since 2×22111012201272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2211101220098 and 2211101220107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2211101220527) 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, 1105550610063 + 1105550610064.
It is an arithmetic number, because the mean of its divisors is an integer number (1105550610064).
Almost surely, 22211101220127 is an apocalyptic number.
2211101220127 is a deficient number, since it is larger than the sum of its proper divisors (1).
2211101220127 is an equidigital number, since it uses as much as digits as its factorization.
2211101220127 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 22.
Adding to 2211101220127 its reverse (7210221011122), we get a palindrome (9421322231249).
The spelling of 2211101220127 in words is "two trillion, two hundred eleven billion, one hundred one million, two hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •