Base | Representation |
---|---|
bin | 11101000110110110100… |
… | …00101100100110110101 |
3 | 10112121110110021210211202 |
4 | 32203123100230212311 |
5 | 112341211403444424 |
6 | 2043240013342245 |
7 | 132153453144113 |
oct | 16433320544665 |
9 | 3477413253752 |
10 | 1000110999989 |
11 | 35616564a922 |
12 | 1419b3197985 |
13 | 734052910ca |
14 | 3659709cab3 |
15 | 1b0363902ae |
hex | e8db42c9b5 |
1000110999989 has 2 divisors, whose sum is σ = 1000110999990. Its totient is φ = 1000110999988.
The previous prime is 1000110999959. The next prime is 1000111000001. The reversal of 1000110999989 is 9899990110001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 978186275089 + 21924724900 = 989033^2 + 148070^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000110999989 - 220 = 1000109951413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000110999959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 500055499994 + 500055499995.
It is an arithmetic number, because the mean of its divisors is an integer number (500055499995).
Almost surely, 21000110999989 is an apocalyptic number.
It is an amenable number.
1000110999989 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000110999989 is an equidigital number, since it uses as much as digits as its factorization.
1000110999989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 472392, while the sum is 56.
The spelling of 1000110999989 in words is "one trillion, one hundred ten million, nine hundred ninety-nine thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •