Base | Representation |
---|---|
bin | 11100110011000101000… |
… | …01010010010001101111 |
3 | 10111121001122002222022122 |
4 | 32121202201102101233 |
5 | 112202441303331423 |
6 | 2034322355503155 |
7 | 131326421610056 |
oct | 16314241222157 |
9 | 3447048088278 |
10 | 989495370863 |
11 | 35170838260a |
12 | 13b92bbb7abb |
13 | 72402b9525c |
14 | 35c6b28539d |
15 | 1ab144288c8 |
hex | e66285246f |
989495370863 has 2 divisors, whose sum is σ = 989495370864. Its totient is φ = 989495370862.
The previous prime is 989495370823. The next prime is 989495370893. The reversal of 989495370863 is 368073594989.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 989495370863 - 210 = 989495369839 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (989495370823) 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, 494747685431 + 494747685432.
It is an arithmetic number, because the mean of its divisors is an integer number (494747685432).
Almost surely, 2989495370863 is an apocalyptic number.
989495370863 is a deficient number, since it is larger than the sum of its proper divisors (1).
989495370863 is an equidigital number, since it uses as much as digits as its factorization.
989495370863 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 352719360, while the sum is 71.
The spelling of 989495370863 in words is "nine hundred eighty-nine billion, four hundred ninety-five million, three hundred seventy thousand, eight hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •