Base | Representation |
---|---|
bin | 10101011100001110… |
… | …101111000101000001 |
3 | 2012102110100002122122 |
4 | 111130032233011001 |
5 | 334122141000301 |
6 | 14324245414025 |
7 | 1443340332644 |
oct | 253416570501 |
9 | 65373302578 |
10 | 23022203201 |
11 | 9844485018 |
12 | 456610a315 |
13 | 222b86435a |
14 | 118582ba5b |
15 | 8eb24881b |
hex | 55c3af141 |
23022203201 has 2 divisors, whose sum is σ = 23022203202. Its totient is φ = 23022203200.
The previous prime is 23022203173. The next prime is 23022203251. The reversal of 23022203201 is 10230222032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22552830976 + 469372225 = 150176^2 + 21665^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23022203201 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 23022203201.
It is not a weakly prime, because it can be changed into another prime (23022203251) 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, 11511101600 + 11511101601.
It is an arithmetic number, because the mean of its divisors is an integer number (11511101601).
Almost surely, 223022203201 is an apocalyptic number.
It is an amenable number.
23022203201 is a deficient number, since it is larger than the sum of its proper divisors (1).
23022203201 is an equidigital number, since it uses as much as digits as its factorization.
23022203201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 23022203201 its reverse (10230222032), we get a palindrome (33252425233).
The spelling of 23022203201 in words is "twenty-three billion, twenty-two million, two hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •