Base | Representation |
---|---|
bin | 10000010100000010000… |
… | …001110010010111011001 |
3 | 10222011112211211011011002 |
4 | 100110002001302113121 |
5 | 121331322221042004 |
6 | 2214553435314345 |
7 | 143663634630404 |
oct | 20240201622731 |
9 | 3864484734132 |
10 | 1121020487129 |
11 | 3a2470927104 |
12 | 1613175ab9b5 |
13 | 81933a1413a |
14 | 3c387110d3b |
15 | 1e2610e861e |
hex | 105020725d9 |
1121020487129 has 2 divisors, whose sum is σ = 1121020487130. Its totient is φ = 1121020487128.
The previous prime is 1121020487089. The next prime is 1121020487137. The reversal of 1121020487129 is 9217840201211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 712290424729 + 408730062400 = 843973^2 + 639320^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121020487129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1121020487092 and 1121020487101.
It is not a weakly prime, because it can be changed into another prime (1121020487159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560510243564 + 560510243565.
It is an arithmetic number, because the mean of its divisors is an integer number (560510243565).
Almost surely, 21121020487129 is an apocalyptic number.
It is an amenable number.
1121020487129 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121020487129 is an equidigital number, since it uses as much as digits as its factorization.
1121020487129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 38.
The spelling of 1121020487129 in words is "one trillion, one hundred twenty-one billion, twenty million, four hundred eighty-seven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •