Base | Representation |
---|---|
bin | 101110001000001100… |
… | …1001110001100101011 |
3 | 100110200121112120121111 |
4 | 1130100121032030223 |
5 | 3110333134420034 |
6 | 113301320251151 |
7 | 10104532054246 |
oct | 1342031161453 |
9 | 313617476544 |
10 | 99059295019 |
11 | 39013431573 |
12 | 17246910ab7 |
13 | 9458963689 |
14 | 4b1a14a25d |
15 | 289b86c364 |
hex | 171064e32b |
99059295019 has 2 divisors, whose sum is σ = 99059295020. Its totient is φ = 99059295018.
The previous prime is 99059294989. The next prime is 99059295053. The reversal of 99059295019 is 91059295099.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 99059295019 - 215 = 99059262251 is a prime.
It is a super-2 number, since 2×990592950192 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (99059295719) 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, 49529647509 + 49529647510.
It is an arithmetic number, because the mean of its divisors is an integer number (49529647510).
Almost surely, 299059295019 is an apocalyptic number.
99059295019 is a deficient number, since it is larger than the sum of its proper divisors (1).
99059295019 is an equidigital number, since it uses as much as digits as its factorization.
99059295019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2952450, while the sum is 58.
The spelling of 99059295019 in words is "ninety-nine billion, fifty-nine million, two hundred ninety-five thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •