Base | Representation |
---|---|
bin | 11101011111000100100… |
… | …11101000101001001101 |
3 | 10120212000122221100222201 |
4 | 32233202103220221031 |
5 | 113044324203100324 |
6 | 2053230155241501 |
7 | 133123624604305 |
oct | 16574223505115 |
9 | 3525018840881 |
10 | 1013114112589 |
11 | 360728560877 |
12 | 144421a49291 |
13 | 746c81b2787 |
14 | 3706bdd8605 |
15 | 1b547c09444 |
hex | ebe24e8a4d |
1013114112589 has 2 divisors, whose sum is σ = 1013114112590. Its totient is φ = 1013114112588.
The previous prime is 1013114112557. The next prime is 1013114112607. The reversal of 1013114112589 is 9852114113101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 912540772900 + 100573339689 = 955270^2 + 317133^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013114112589 - 25 = 1013114112557 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013114113589) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 506557056294 + 506557056295.
It is an arithmetic number, because the mean of its divisors is an integer number (506557056295).
Almost surely, 21013114112589 is an apocalyptic number.
It is an amenable number.
1013114112589 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013114112589 is an equidigital number, since it uses as much as digits as its factorization.
1013114112589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 37.
The spelling of 1013114112589 in words is "one trillion, thirteen billion, one hundred fourteen million, one hundred twelve thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •