Base | Representation |
---|---|
bin | 11101101100000111110… |
… | …01110001111010110111 |
3 | 10121112002221011001101202 |
4 | 32312003321301322313 |
5 | 113203201233224002 |
6 | 2100345312243115 |
7 | 133462346503463 |
oct | 16660371617267 |
9 | 3545087131352 |
10 | 1020120211127 |
11 | 3636a32a0356 |
12 | 14585824049b |
13 | 75273842504 |
14 | 375346a14a3 |
15 | 1b807d2a502 |
hex | ed83e71eb7 |
1020120211127 has 2 divisors, whose sum is σ = 1020120211128. Its totient is φ = 1020120211126.
The previous prime is 1020120211093. The next prime is 1020120211133. The reversal of 1020120211127 is 7211120210201.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (7211120210201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1020120211127 - 212 = 1020120207031 is a prime.
It is a super-2 number, since 2×10201202111272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020120211099 and 1020120211108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1020120211727) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510060105563 + 510060105564.
It is an arithmetic number, because the mean of its divisors is an integer number (510060105564).
Almost surely, 21020120211127 is an apocalyptic number.
1020120211127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1020120211127 is an equidigital number, since it uses as much as digits as its factorization.
1020120211127 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 20.
Adding to 1020120211127 its reverse (7211120210201), we get a palindrome (8231240421328).
The spelling of 1020120211127 in words is "one trillion, twenty billion, one hundred twenty million, two hundred eleven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •