Base | Representation |
---|---|
bin | 1000001100110010… |
… | …0001111101011111 |
3 | 12200101202110201221 |
4 | 2003030201331133 |
5 | 14001440201002 |
6 | 1002225114211 |
7 | 105355020352 |
oct | 20314417537 |
9 | 5611673657 |
10 | 2201100127 |
11 | a2a511116 |
12 | 515188967 |
13 | 291028315 |
14 | 16c486299 |
15 | cd387c37 |
hex | 83321f5f |
2201100127 has 2 divisors, whose sum is σ = 2201100128. Its totient is φ = 2201100126.
The previous prime is 2201100101. The next prime is 2201100131. The reversal of 2201100127 is 7210011022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2201100127 - 227 = 2066882399 is a prime.
It is a super-2 number, since 2×22011001272 = 9689683538158832258, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2201100127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201100427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100550063 + 1100550064.
It is an arithmetic number, because the mean of its divisors is an integer number (1100550064).
Almost surely, 22201100127 is an apocalyptic number.
2201100127 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201100127 is an equidigital number, since it uses as much as digits as its factorization.
2201100127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 16.
The square root of 2201100127 is about 46915.8835257315. The cubic root of 2201100127 is about 1300.8082009932.
Adding to 2201100127 its reverse (7210011022), we get a palindrome (9411111149).
The spelling of 2201100127 in words is "two billion, two hundred one million, one hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •