Base | Representation |
---|---|
bin | 1010100110110001001110… |
… | …10001001011101011101111 |
3 | 10001120121000100210222120221 |
4 | 11103120213101023223233 |
5 | 11024103113243424012 |
6 | 121334044150352211 |
7 | 4624661052402052 |
oct | 523304721135357 |
9 | 101517010728527 |
10 | 23322331233007 |
11 | 7481a43a72984 |
12 | 274803565b667 |
13 | 10023952a9581 |
14 | 5a8b4201aa99 |
15 | 2a6a024e5507 |
hex | 15362744baef |
23322331233007 has 2 divisors, whose sum is σ = 23322331233008. Its totient is φ = 23322331233006.
The previous prime is 23322331232999. The next prime is 23322331233041. The reversal of 23322331233007 is 70033213322332.
It is an a-pointer prime, because the next prime (23322331233041) can be obtained adding 23322331233007 to its sum of digits (34).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 23322331233007 - 23 = 23322331232999 is a prime.
It is a super-2 number, since 2×233223312330072 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (23322331233077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11661165616503 + 11661165616504.
It is an arithmetic number, because the mean of its divisors is an integer number (11661165616504).
Almost surely, 223322331233007 is an apocalyptic number.
23322331233007 is a deficient number, since it is larger than the sum of its proper divisors (1).
23322331233007 is an equidigital number, since it uses as much as digits as its factorization.
23322331233007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81648, while the sum is 34.
Adding to 23322331233007 its reverse (70033213322332), we get a palindrome (93355544555339).
The spelling of 23322331233007 in words is "twenty-three trillion, three hundred twenty-two billion, three hundred thirty-one million, two hundred thirty-three thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •