Base | Representation |
---|---|
bin | 1110100100010000010000… |
… | …0000000001000100000000 |
3 | 2002201010002120220011000010 |
4 | 3221010010000001010000 |
5 | 4044401232020110000 |
6 | 54021352055024520 |
7 | 3242055262103331 |
oct | 351040400010400 |
9 | 62633076804003 |
10 | 16016000160000 |
11 | 51153906104a5 |
12 | 196801206b140 |
13 | 8c23c12c92c9 |
14 | 3d526dcd2288 |
15 | 1cb92d903d50 |
hex | e9104001100 |
16016000160000 has 720 divisors, whose sum is σ = 54632403484736. Its totient is φ = 4161798144000.
The previous prime is 16016000159977. The next prime is 16016000160001. The reversal of 16016000160000 is 6100061061.
It is a super-2 number, since 2×160160001600002 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (16016000160001) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 13890719424 + ... + 13890720576.
Almost surely, 216016000160000 is an apocalyptic number.
16016000160000 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 16016000160000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27316201742368).
16016000160000 is an abundant number, since it is smaller than the sum of its proper divisors (38616403324736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16016000160000 is an equidigital number, since it uses as much as digits as its factorization.
16016000160000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1908 (or 1879 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
The spelling of 16016000160000 in words is "sixteen trillion, sixteen billion, one hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •