Base | Representation |
---|---|
bin | 10000010100000010000… |
… | …000101100010010111111 |
3 | 10222011112211021120110101 |
4 | 100110002000230102333 |
5 | 121331322132401002 |
6 | 2214553425221531 |
7 | 143663632323562 |
oct | 20240200542277 |
9 | 3864484246411 |
10 | 1121020200127 |
11 | 3a2470750513 |
12 | 1613174918a7 |
13 | 81933943609 |
14 | 3c3870784d9 |
15 | 1e26108d587 |
hex | 1050202c4bf |
1121020200127 has 2 divisors, whose sum is σ = 1121020200128. Its totient is φ = 1121020200126.
The previous prime is 1121020200107. The next prime is 1121020200133. The reversal of 1121020200127 is 7210020201211.
It is a strong prime.
It is an emirp because it is prime and its reverse (7210020201211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1121020200127 - 215 = 1121020167359 is a prime.
It is a super-2 number, since 2×11210202001272 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121020200107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560510100063 + 560510100064.
It is an arithmetic number, because the mean of its divisors is an integer number (560510100064).
Almost surely, 21121020200127 is an apocalyptic number.
1121020200127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121020200127 is an equidigital number, since it uses as much as digits as its factorization.
1121020200127 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 1121020200127 its reverse (7210020201211), we get a palindrome (8331040401338).
The spelling of 1121020200127 in words is "one trillion, one hundred twenty-one billion, twenty million, two hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •