Base | Representation |
---|---|
bin | 1010100111000101101010… |
… | …01011110010111001000001 |
3 | 10001121122022221110210021212 |
4 | 11103202311023302321001 |
5 | 11024243100320320001 |
6 | 121343100534455505 |
7 | 4625526656402246 |
oct | 523426513627101 |
9 | 101548287423255 |
10 | 23333302120001 |
11 | 7486663826735 |
12 | 274a197804595 |
13 | 100342317c893 |
14 | 5a94a30ad5cd |
15 | 2a6e457337bb |
hex | 1538b52f2e41 |
23333302120001 has 2 divisors, whose sum is σ = 23333302120002. Its totient is φ = 23333302120000.
The previous prime is 23333302119979. The next prime is 23333302120013. The reversal of 23333302120001 is 10002120333332.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12253857303601 + 11079444816400 = 3500551^2 + 3328580^2 .
It is a cyclic number.
It is not a de Polignac number, because 23333302120001 - 242 = 18935255608897 is a prime.
It is a super-2 number, since 2×233333021200012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (23333302120021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11666651060000 + 11666651060001.
It is an arithmetic number, because the mean of its divisors is an integer number (11666651060001).
Almost surely, 223333302120001 is an apocalyptic number.
It is an amenable number.
23333302120001 is a deficient number, since it is larger than the sum of its proper divisors (1).
23333302120001 is an equidigital number, since it uses as much as digits as its factorization.
23333302120001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 23333302120001 its reverse (10002120333332), we get a palindrome (33335422453333).
The spelling of 23333302120001 in words is "twenty-three trillion, three hundred thirty-three billion, three hundred two million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •