Base | Representation |
---|---|
bin | 1110100111010101001001… |
… | …0000110101101000000000 |
3 | 2002220011111222110110001022 |
4 | 3221311102100311220000 |
5 | 4101233002304100000 |
6 | 54101532402325012 |
7 | 3245636103115640 |
oct | 351652220655000 |
9 | 62804458413038 |
10 | 16068852800000 |
11 | 5135842545170 |
12 | 1976302359768 |
13 | 8c73950671a0 |
14 | 3d7a4542a520 |
15 | 1ccec3930585 |
hex | e9d52435a00 |
16068852800000 has 1920 divisors, whose sum is σ = 54992960225280. Its totient is φ = 4528742400000.
The previous prime is 16068852799939. The next prime is 16068852800053. The reversal of 16068852800000 is 825886061.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 126526399937 + ... + 126526400063.
It is an arithmetic number, because the mean of its divisors is an integer number (28642166784).
Almost surely, 216068852800000 is an apocalyptic number.
16068852800000 is a gapful number since it is divisible by the number (10) 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 16068852800000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27496480112640).
16068852800000 is an abundant number, since it is smaller than the sum of its proper divisors (38924107425280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16068852800000 is an equidigital number, since it uses as much as digits as its factorization.
16068852800000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 280 (or 244 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 44.
The spelling of 16068852800000 in words is "sixteen trillion, sixty-eight billion, eight hundred fifty-two million, eight hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •