Base | Representation |
---|---|
bin | 1000001011010010110001… |
… | …1100000101100110001101 |
3 | 1011211110001101000000120211 |
4 | 2002310230130011212031 |
5 | 2134243222200022424 |
6 | 31042000034442421 |
7 | 1615341234046432 |
oct | 202645434054615 |
9 | 34743041000524 |
10 | 8990112110989 |
11 | 2956759a07829 |
12 | 1012416433411 |
13 | 5029c14966a9 |
14 | 2311a37c7b89 |
15 | 108cc05b6b94 |
hex | 82d2c70598d |
8990112110989 has 2 divisors, whose sum is σ = 8990112110990. Its totient is φ = 8990112110988.
The previous prime is 8990112110953. The next prime is 8990112111073. The reversal of 8990112110989 is 9890112110998.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7814876160100 + 1175235950889 = 2795510^2 + 1084083^2 .
It is a cyclic number.
It is not a de Polignac number, because 8990112110989 - 211 = 8990112108941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8990112110689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4495056055494 + 4495056055495.
It is an arithmetic number, because the mean of its divisors is an integer number (4495056055495).
Almost surely, 28990112110989 is an apocalyptic number.
It is an amenable number.
8990112110989 is a deficient number, since it is larger than the sum of its proper divisors (1).
8990112110989 is an equidigital number, since it uses as much as digits as its factorization.
8990112110989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 839808, while the sum is 58.
Subtracting 8990112110989 from its reverse (9890112110998), we obtain a palindrome (900000000009).
The spelling of 8990112110989 in words is "eight trillion, nine hundred ninety billion, one hundred twelve million, one hundred ten thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •