Base | Representation |
---|---|
bin | 1010100110110001001110… |
… | …01100011111001001011001 |
3 | 10001120121000021111102222102 |
4 | 11103120213030133021121 |
5 | 11024103112440031014 |
6 | 121334044104133145 |
7 | 4624661036054123 |
oct | 523304714371131 |
9 | 101517007442872 |
10 | 23322330002009 |
11 | 7481a43302025 |
12 | 27480351671b5 |
13 | 1002394c6817c |
14 | 5a8b41bba213 |
15 | 2a6a023508de |
hex | 15362731f259 |
23322330002009 has 2 divisors, whose sum is σ = 23322330002010. Its totient is φ = 23322330002008.
The previous prime is 23322330001979. The next prime is 23322330002011. The reversal of 23322330002009 is 90020003322332.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20112040776025 + 3210289225984 = 4484645^2 + 1791728^2 .
It is a cyclic number.
It is not a de Polignac number, because 23322330002009 - 212 = 23322329997913 is a prime.
Together with 23322330002011, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (23322330002029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11661165001004 + 11661165001005.
It is an arithmetic number, because the mean of its divisors is an integer number (11661165001005).
Almost surely, 223322330002009 is an apocalyptic number.
It is an amenable number.
23322330002009 is a deficient number, since it is larger than the sum of its proper divisors (1).
23322330002009 is an equidigital number, since it uses as much as digits as its factorization.
23322330002009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 29.
The spelling of 23322330002009 in words is "twenty-three trillion, three hundred twenty-two billion, three hundred thirty million, two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •