Base | Representation |
---|---|
bin | 11101000100111110000… |
… | …00000000000111010111 |
3 | 10112111211222220012112101 |
4 | 32202133000000013113 |
5 | 112332124044143422 |
6 | 2042551420102531 |
7 | 132116425540414 |
oct | 16423700000727 |
9 | 3474758805471 |
10 | 999099990487 |
11 | 355796997485 |
12 | 141770694a47 |
13 | 732a399aa31 |
14 | 364dcac710b |
15 | 1aec7736c27 |
hex | e89f0001d7 |
999099990487 has 2 divisors, whose sum is σ = 999099990488. Its totient is φ = 999099990486.
The previous prime is 999099990479. The next prime is 999099990503. The reversal of 999099990487 is 784099990999.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 999099990487 - 23 = 999099990479 is a prime.
It is a super-2 number, since 2×9990999904872 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 999099990487.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (999099990467) 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, 499549995243 + 499549995244.
It is an arithmetic number, because the mean of its divisors is an integer number (499549995244).
Almost surely, 2999099990487 is an apocalyptic number.
999099990487 is a deficient number, since it is larger than the sum of its proper divisors (1).
999099990487 is an equidigital number, since it uses as much as digits as its factorization.
999099990487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1071385056, while the sum is 82.
The spelling of 999099990487 in words is "nine hundred ninety-nine billion, ninety-nine million, nine hundred ninety thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •