Base | Representation |
---|---|
bin | 10110100101010110111110… |
… | …110100000000001100000101 |
3 | 111000200022102122020022200112 |
4 | 112211112332310000030011 |
5 | 101004312201411221201 |
6 | 551124543535522405 |
7 | 26630642146122602 |
oct | 2645267664001405 |
9 | 430608378208615 |
10 | 99324320023301 |
11 | 29714231300a9a |
12 | b181875989405 |
13 | 4356321394049 |
14 | 1a7547384d6a9 |
15 | b739c08700bb |
hex | 5a55bed00305 |
99324320023301 has 2 divisors, whose sum is σ = 99324320023302. Its totient is φ = 99324320023300.
The previous prime is 99324320023277. The next prime is 99324320023309. The reversal of 99324320023301 is 10332002342399.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97239833772676 + 2084486250625 = 9861026^2 + 1443775^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-99324320023301 is a prime.
It is a super-2 number, since 2×993243200233012 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (99324320023309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49662160011650 + 49662160011651.
It is an arithmetic number, because the mean of its divisors is an integer number (49662160011651).
Almost surely, 299324320023301 is an apocalyptic number.
It is an amenable number.
99324320023301 is a deficient number, since it is larger than the sum of its proper divisors (1).
99324320023301 is an equidigital number, since it uses as much as digits as its factorization.
99324320023301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 209952, while the sum is 41.
The spelling of 99324320023301 in words is "ninety-nine trillion, three hundred twenty-four billion, three hundred twenty million, twenty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •