Base | Representation |
---|---|
bin | 10110000011100110… |
… | …011001000110100000 |
3 | 2021010111012121222000 |
4 | 112003212121012200 |
5 | 342000233403224 |
6 | 14514002444000 |
7 | 1465610523300 |
oct | 260346310640 |
9 | 67114177860 |
10 | 23682716064 |
11 | a053304117 |
12 | 470b363600 |
13 | 2305659477 |
14 | 1209447600 |
15 | 93921b0c9 |
hex | 5839991a0 |
23682716064 has 576 divisors, whose sum is σ = 83334182400. Its totient is φ = 6521389056.
The previous prime is 23682716063. The next prime is 23682716089. The reversal of 23682716064 is 46061728632.
23682716064 is a `hidden beast` number, since 2 + 36 + 8 + 2 + 7 + 1 + 606 + 4 = 666.
It is not an unprimeable number, because it can be changed into a prime (23682716063) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 244151664 + ... + 244151760.
It is an arithmetic number, because the mean of its divisors is an integer number (144677400).
Almost surely, 223682716064 is an apocalyptic number.
23682716064 is a gapful number since it is divisible by the number (24) 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 23682716064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41667091200).
23682716064 is an abundant number, since it is smaller than the sum of its proper divisors (59651466336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23682716064 is a wasteful number, since it uses less digits than its factorization.
23682716064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 282 (or 261 counting only the distinct ones).
The product of its (nonzero) digits is 580608, while the sum is 45.
The spelling of 23682716064 in words is "twenty-three billion, six hundred eighty-two million, seven hundred sixteen thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •