Base | Representation |
---|---|
bin | 10000001001110010010… |
… | …110101110001111110101 |
3 | 10221010011012200200111011 |
4 | 100021302112232033311 |
5 | 121141310122342324 |
6 | 2205534115312221 |
7 | 143124222233011 |
oct | 20116226561765 |
9 | 3833135620434 |
10 | 1110020121589 |
11 | 398836469715 |
12 | 15b1675ab671 |
13 | 8089c9bc2c2 |
14 | 3ba22187541 |
15 | 1dd1a4d5c94 |
hex | 102725ae3f5 |
1110020121589 has 2 divisors, whose sum is σ = 1110020121590. Its totient is φ = 1110020121588.
The previous prime is 1110020121577. The next prime is 1110020121611. The reversal of 1110020121589 is 9851210200111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 659197848100 + 450822273489 = 811910^2 + 671433^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1110020121589 is a prime.
It is a super-3 number, since 3×11100201215893 (a number of 37 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1110020121589.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1110020121289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555010060794 + 555010060795.
It is an arithmetic number, because the mean of its divisors is an integer number (555010060795).
Almost surely, 21110020121589 is an apocalyptic number.
It is an amenable number.
1110020121589 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110020121589 is an equidigital number, since it uses as much as digits as its factorization.
1110020121589 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 31.
The spelling of 1110020121589 in words is "one trillion, one hundred ten billion, twenty million, one hundred twenty-one thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •