Base | Representation |
---|---|
bin | 10110001011100100… |
… | …011101011000100000 |
3 | 2021110210210211221101 |
4 | 112023210131120200 |
5 | 342234001131130 |
6 | 14535140404144 |
7 | 1502123201230 |
oct | 261344353040 |
9 | 67423724841 |
10 | 23816427040 |
11 | a11183015a |
12 | 47480a6654 |
13 | 23272740a3 |
14 | 121d0d1cc0 |
15 | 945d2e1ca |
hex | 58b91d620 |
23816427040 has 384 divisors, whose sum is σ = 70911590400. Its totient is φ = 7375380480.
The previous prime is 23816427031. The next prime is 23816427043. The reversal of 23816427040 is 4072461832.
It is not an unprimeable number, because it can be changed into a prime (23816427043) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 52114492 + ... + 52114948.
It is an arithmetic number, because the mean of its divisors is an integer number (184665600).
Almost surely, 223816427040 is an apocalyptic number.
23816427040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23816427040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35455795200).
23816427040 is an abundant number, since it is smaller than the sum of its proper divisors (47095163360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23816427040 is a wasteful number, since it uses less digits than its factorization.
23816427040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 608 (or 600 counting only the distinct ones).
The product of its (nonzero) digits is 64512, while the sum is 37.
Adding to 23816427040 its reverse (4072461832), we get a palindrome (27888888872).
The spelling of 23816427040 in words is "twenty-three billion, eight hundred sixteen million, four hundred twenty-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •