Base | Representation |
---|---|
bin | 11000100011110010000001… |
… | …11101101001000011101000 |
3 | 21002012220221121020120101220 |
4 | 30101321000331221003220 |
5 | 24034313301210240210 |
6 | 310510003510142040 |
7 | 14242543145365560 |
oct | 1421710075510350 |
9 | 232186847216356 |
10 | 54006008680680 |
11 | 16231901a6a461 |
12 | 6082887051920 |
13 | 241998b336664 |
14 | d49c94975da0 |
15 | 639c483b9c70 |
hex | 311e40f690e8 |
54006008680680 has 1024 divisors, whose sum is σ = 205802616913920. Its totient is φ = 11054776320000.
The previous prime is 54006008680511. The next prime is 54006008680681. The reversal of 54006008680680 is 8608680060045.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is not an unprimeable number, because it can be changed into a prime (54006008680681) by changing a digit.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 6352896430 + ... + 6352904930.
It is an arithmetic number, because the mean of its divisors is an integer number (200979118080).
Almost surely, 254006008680680 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 54006008680680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102901308456960).
54006008680680 is an abundant number, since it is smaller than the sum of its proper divisors (151796608233240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54006008680680 is a wasteful number, since it uses less digits than its factorization.
54006008680680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8810 (or 8806 counting only the distinct ones).
The product of its (nonzero) digits is 2211840, while the sum is 51.
The spelling of 54006008680680 in words is "fifty-four trillion, six billion, eight million, six hundred eighty thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •