Base | Representation |
---|---|
bin | 101110100001100011… |
… | …0000110101001010111 |
3 | 100112212220010212121001 |
4 | 1131003012012221113 |
5 | 3114103414440432 |
6 | 113521544204131 |
7 | 10134601214404 |
oct | 1350306065127 |
9 | 315786125531 |
10 | 99909921367 |
11 | 3940a600753 |
12 | 17443769647 |
13 | 9562c60a89 |
14 | 4b9b0d32ab |
15 | 28eb3949e7 |
hex | 1743186a57 |
99909921367 has 2 divisors, whose sum is σ = 99909921368. Its totient is φ = 99909921366.
The previous prime is 99909921337. The next prime is 99909921373. The reversal of 99909921367 is 76312990999.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 99909921367 - 27 = 99909921239 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 99909921299 and 99909921308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (99909921337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49954960683 + 49954960684.
It is an arithmetic number, because the mean of its divisors is an integer number (49954960684).
Almost surely, 299909921367 is an apocalyptic number.
99909921367 is a deficient number, since it is larger than the sum of its proper divisors (1).
99909921367 is an equidigital number, since it uses as much as digits as its factorization.
99909921367 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 14880348, while the sum is 64.
The spelling of 99909921367 in words is "ninety-nine billion, nine hundred nine million, nine hundred twenty-one thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •