Base | Representation |
---|---|
bin | 10101011011000010… |
… | …001000001110100000 |
3 | 2012101001112211012212 |
4 | 111123002020032200 |
5 | 334102020333440 |
6 | 14322251141252 |
7 | 1443004542416 |
oct | 253302101640 |
9 | 65331484185 |
10 | 23002121120 |
11 | 9834109060 |
12 | 455b444828 |
13 | 2227652774 |
14 | 1182cc12b6 |
15 | 8e95cd465 |
hex | 55b0883a0 |
23002121120 has 48 divisors (see below), whose sum is σ = 59282743968. Its totient is φ = 8364407040.
The previous prime is 23002121119. The next prime is 23002121123. The reversal of 23002121120 is 2112120032.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 23002121095 and 23002121104.
It is not an unprimeable number, because it can be changed into a prime (23002121123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6532934 + ... + 6536453.
It is an arithmetic number, because the mean of its divisors is an integer number (1235057166).
Almost surely, 223002121120 is an apocalyptic number.
23002121120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23002121120 is an abundant number, since it is smaller than the sum of its proper divisors (36280622848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23002121120 is a wasteful number, since it uses less digits than its factorization.
23002121120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13069413 (or 13069405 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 23002121120 its reverse (2112120032), we get a palindrome (25114241152).
The spelling of 23002121120 in words is "twenty-three billion, two million, one hundred twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •