Base | Representation |
---|---|
bin | 100001110000101010110… |
… | …010011011011001000101 |
3 | 22012210022210200102110212 |
4 | 201300222302123121011 |
5 | 301002330022433214 |
6 | 4533443211525205 |
7 | 326420524226216 |
oct | 41605262333105 |
9 | 8183283612425 |
10 | 2320000202309 |
11 | 8149a76a50a9 |
12 | 31576b459805 |
13 | 13aa0cb0b9ca |
14 | 80407d2b40d |
15 | 4053644753e |
hex | 21c2ac9b645 |
2320000202309 has 2 divisors, whose sum is σ = 2320000202310. Its totient is φ = 2320000202308.
The previous prime is 2320000202291. The next prime is 2320000202339. The reversal of 2320000202309 is 9032020000232.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1422480811684 + 897519390625 = 1192678^2 + 947375^2 .
It is a cyclic number.
It is not a de Polignac number, because 2320000202309 - 232 = 2315705235013 is a prime.
It is a super-4 number, since 4×23200002023094 (a number of 51 digits) contains 4444 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 (2320000202339) 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, 1160000101154 + 1160000101155.
It is an arithmetic number, because the mean of its divisors is an integer number (1160000101155).
Almost surely, 22320000202309 is an apocalyptic number.
It is an amenable number.
2320000202309 is a deficient number, since it is larger than the sum of its proper divisors (1).
2320000202309 is an equidigital number, since it uses as much as digits as its factorization.
2320000202309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
The spelling of 2320000202309 in words is "two trillion, three hundred twenty billion, two hundred two thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •