Base | Representation |
---|---|
bin | 1010100110011100011000… |
… | …01110111001001111101000 |
3 | 10001112112010102222010122112 |
4 | 11103032030032321033220 |
5 | 11023412203344330440 |
6 | 121324553500341452 |
7 | 4624113533423351 |
oct | 523161416711750 |
9 | 101475112863575 |
10 | 23311140230120 |
11 | 7478220a37866 |
12 | 2745a31844888 |
13 | 1001300927b82 |
14 | 5a839da2ad28 |
15 | 2a6599cc7965 |
hex | 15338c3b93e8 |
23311140230120 has 32 divisors (see below), whose sum is σ = 52797416958720. Its totient is φ = 9262704724800.
The previous prime is 23311140230117. The next prime is 23311140230177. The reversal of 23311140230120 is 2103204111332.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1929724112 + ... + 1929736191.
It is an arithmetic number, because the mean of its divisors is an integer number (1649919279960).
Almost surely, 223311140230120 is an apocalyptic number.
23311140230120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
23311140230120 is an abundant number, since it is smaller than the sum of its proper divisors (29486276728600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23311140230120 is a wasteful number, since it uses less digits than its factorization.
23311140230120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3859460465 (or 3859460461 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 23311140230120 its reverse (2103204111332), we get a palindrome (25414344341452).
The spelling of 23311140230120 in words is "twenty-three trillion, three hundred eleven billion, one hundred forty million, two hundred thirty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.370 sec. • engine limits •