Base | Representation |
---|---|
bin | 100000000100111001… |
… | …1110011110010000000 |
3 | 20120210122111110112200 |
4 | 1000021303303302000 |
5 | 2112033304144440 |
6 | 51351144153200 |
7 | 4656003535131 |
oct | 1001163636200 |
9 | 216718443480 |
10 | 68884053120 |
11 | 27239285723 |
12 | 11425168800 |
13 | 665a1a235c |
14 | 3496725c88 |
15 | 1bd2679c30 |
hex | 1009cf3c80 |
68884053120 has 384 divisors, whose sum is σ = 251950608000. Its totient is φ = 17293492224.
The previous prime is 68884053103. The next prime is 68884053149. The reversal of 68884053120 is 2135048886.
It is a tau number, because it is divible by the number of its divisors (384).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18274596 + ... + 18278364.
It is an arithmetic number, because the mean of its divisors is an integer number (656121375).
Almost surely, 268884053120 is an apocalyptic number.
68884053120 is a gapful number since it is divisible by the number (60) 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 68884053120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125975304000).
68884053120 is an abundant number, since it is smaller than the sum of its proper divisors (183066554880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
68884053120 is a wasteful number, since it uses less digits than its factorization.
68884053120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3980 (or 3965 counting only the distinct ones).
The product of its (nonzero) digits is 368640, while the sum is 45.
The spelling of 68884053120 in words is "sixty-eight billion, eight hundred eighty-four million, fifty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •