Base | Representation |
---|---|
bin | 10101011011100101… |
… | …001110000100111000 |
3 | 2012101200212011212120 |
4 | 111123211032010320 |
5 | 334111344220440 |
6 | 14323220241240 |
7 | 1443145664565 |
oct | 253345160470 |
9 | 65350764776 |
10 | 23011320120 |
11 | 9839321438 |
12 | 4562540220 |
13 | 2229523869 |
14 | 11841d786c |
15 | 8ea2e8dd0 |
hex | 55b94e138 |
23011320120 has 64 divisors (see below), whose sum is σ = 69116544000. Its totient is φ = 6129011328.
The previous prime is 23011320019. The next prime is 23011320133. The reversal of 23011320120 is 2102311032.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 23011320120.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 13600 + ... + 214959.
It is an arithmetic number, because the mean of its divisors is an integer number (1079946000).
Almost surely, 223011320120 is an apocalyptic number.
23011320120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23011320120 is an abundant number, since it is smaller than the sum of its proper divisors (46105223880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23011320120 is a wasteful number, since it uses less digits than its factorization.
23011320120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229412 (or 229408 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 23011320120 its reverse (2102311032), we get a palindrome (25113631152).
The spelling of 23011320120 in words is "twenty-three billion, eleven million, three hundred twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •