Base | Representation |
---|---|
bin | 10101011011100100… |
… | …110001010010011001 |
3 | 2012101200122012010012 |
4 | 111123210301102121 |
5 | 334111331432301 |
6 | 14323213531305 |
7 | 1443144664031 |
oct | 253344612231 |
9 | 65350565105 |
10 | 23011202201 |
11 | 9839250889 |
12 | 45624a3b35 |
13 | 22294b1ca0 |
14 | 11841a68c1 |
15 | 8ea2c3ebb |
hex | 55b931499 |
23011202201 has 8 divisors (see below), whose sum is σ = 24907090824. Its totient is φ = 21133284480.
The previous prime is 23011202183. The next prime is 23011202237. The reversal of 23011202201 is 10220211032.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 3662670400 + 19348531801 = 60520^2 + 139099^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23011202201 - 234 = 5831333017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23011202101) 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 in 7 ways as a sum of consecutive naturals, for example, 4490060 + ... + 4495181.
It is an arithmetic number, because the mean of its divisors is an integer number (3113386353).
Almost surely, 223011202201 is an apocalyptic number.
It is an amenable number.
23011202201 is a deficient number, since it is larger than the sum of its proper divisors (1895888623).
23011202201 is a wasteful number, since it uses less digits than its factorization.
23011202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8985451.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 23011202201 its reverse (10220211032), we get a palindrome (33231413233).
The spelling of 23011202201 in words is "twenty-three billion, eleven million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •