Base | Representation |
---|---|
bin | 10101100111000001… |
… | …101100000001111101 |
3 | 2012220002011101221212 |
4 | 111213001230001331 |
5 | 340010023112341 |
6 | 14354235534205 |
7 | 1451000032616 |
oct | 254701540175 |
9 | 65802141855 |
10 | 23203332221 |
11 | 9927748a23 |
12 | 45b68ba365 |
13 | 225a2420a4 |
14 | 11a18dac0d |
15 | 90c0c65eb |
hex | 56706c07d |
23203332221 has 2 divisors, whose sum is σ = 23203332222. Its totient is φ = 23203332220.
The previous prime is 23203332179. The next prime is 23203332223. The reversal of 23203332221 is 12223330232.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17256763225 + 5946568996 = 131365^2 + 77114^2 .
It is a cyclic number.
It is not a de Polignac number, because 23203332221 - 26 = 23203332157 is a prime.
It is a Sophie Germain prime.
Together with 23203332223, it forms a pair of twin primes.
It is a Chen 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 (23203332223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11601666110 + 11601666111.
It is an arithmetic number, because the mean of its divisors is an integer number (11601666111).
Almost surely, 223203332221 is an apocalyptic number.
It is an amenable number.
23203332221 is a deficient number, since it is larger than the sum of its proper divisors (1).
23203332221 is an equidigital number, since it uses as much as digits as its factorization.
23203332221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 23203332221 its reverse (12223330232), we get a palindrome (35426662453).
The spelling of 23203332221 in words is "twenty-three billion, two hundred three million, three hundred thirty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •