Base | Representation |
---|---|
bin | 11101001010110001111… |
… | …10101100011111001111 |
3 | 10112210220110010210012202 |
4 | 32211120332230133033 |
5 | 112410021333211002 |
6 | 2044225201152115 |
7 | 132256644140603 |
oct | 16453076543717 |
9 | 3483813123182 |
10 | 1002220210127 |
11 | 3570481a96a4 |
12 | 1422a162b63b |
13 | 73680255146 |
14 | 36717265503 |
15 | 1b10b626502 |
hex | e958fac7cf |
1002220210127 has 2 divisors, whose sum is σ = 1002220210128. Its totient is φ = 1002220210126.
The previous prime is 1002220210037. The next prime is 1002220210163. The reversal of 1002220210127 is 7210120222001.
It is a strong prime.
It is an emirp because it is prime and its reverse (7210120222001) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1002220210127 is a prime.
It is a super-2 number, since 2×10022202101272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1002220210099 and 1002220210108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1002220210027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 501110105063 + 501110105064.
It is an arithmetic number, because the mean of its divisors is an integer number (501110105064).
Almost surely, 21002220210127 is an apocalyptic number.
1002220210127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1002220210127 is an equidigital number, since it uses as much as digits as its factorization.
1002220210127 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 1002220210127 its reverse (7210120222001), we get a palindrome (8212340432128).
The spelling of 1002220210127 in words is "one trillion, two billion, two hundred twenty million, two hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •