Base | Representation |
---|---|
bin | 10101100010000100… |
… | …001110111000110001 |
3 | 2012200021120102220221 |
4 | 111202010032320301 |
5 | 334322222110301 |
6 | 14342104133041 |
7 | 1445636501563 |
oct | 254204167061 |
9 | 65607512827 |
10 | 23120113201 |
11 | 9894779279 |
12 | 4592a67181 |
13 | 2245c25773 |
14 | 1194837333 |
15 | 904b38da1 |
hex | 56210ee31 |
23120113201 has 4 divisors (see below), whose sum is σ = 23126646004. Its totient is φ = 23113580400.
The previous prime is 23120113171. The next prime is 23120113231. The reversal of 23120113201 is 10231102132.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (23120113171) and next prime (23120113231).
It can be written as a sum of positive squares in 2 ways, for example, as 6371870976 + 16748242225 = 79824^2 + 129415^2 .
It is a cyclic number.
It is not a de Polignac number, because 23120113201 - 215 = 23120080433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23120113231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3261090 + ... + 3268171.
It is an arithmetic number, because the mean of its divisors is an integer number (5781661501).
Almost surely, 223120113201 is an apocalyptic number.
It is an amenable number.
23120113201 is a deficient number, since it is larger than the sum of its proper divisors (6532803).
23120113201 is an equidigital number, since it uses as much as digits as its factorization.
23120113201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6532802.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 23120113201 its reverse (10231102132), we get a palindrome (33351215333).
The spelling of 23120113201 in words is "twenty-three billion, one hundred twenty million, one hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •