Base | Representation |
---|---|
bin | 10000001010101100000… |
… | …110110100011010010011 |
3 | 10221012122201212101102002 |
4 | 100022230012310122103 |
5 | 121200301142443214 |
6 | 2210214210344215 |
7 | 143160225643655 |
oct | 20125406643223 |
9 | 3835581771362 |
10 | 1110989031059 |
11 | 399193387746 |
12 | 15b397b8b06b |
13 | 809c566200b |
14 | 3bab4b206d5 |
15 | 1dd755c51de |
hex | 102ac1b4693 |
1110989031059 has 2 divisors, whose sum is σ = 1110989031060. Its totient is φ = 1110989031058.
The previous prime is 1110989031037. The next prime is 1110989031107. The reversal of 1110989031059 is 9501309890111.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1110989031059 - 28 = 1110989030803 is a prime.
It is a super-2 number, since 2×11109890310592 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1110989031029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555494515529 + 555494515530.
It is an arithmetic number, because the mean of its divisors is an integer number (555494515530).
Almost surely, 21110989031059 is an apocalyptic number.
1110989031059 is a deficient number, since it is larger than the sum of its proper divisors (1).
1110989031059 is an equidigital number, since it uses as much as digits as its factorization.
1110989031059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 47.
The spelling of 1110989031059 in words is "one trillion, one hundred ten billion, nine hundred eighty-nine million, thirty-one thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •