Base | Representation |
---|---|
bin | 1110101011011100100011… |
… | …1001000000000000000000 |
3 | 2010010221000212021012220110 |
4 | 3222313020321000000000 |
5 | 4103412311001011410 |
6 | 54154225045111320 |
7 | 3254021255565564 |
oct | 352671071000000 |
9 | 63127025235813 |
10 | 16139562516480 |
11 | 5162828312787 |
12 | 1987b569b8540 |
13 | 900c53543700 |
14 | 3db2323c96a4 |
15 | 1cec614d2720 |
hex | eadc8e40000 |
16139562516480 has 912 divisors, whose sum is σ = 56645645198400. Its totient is φ = 3921942675456.
The previous prime is 16139562516479. The next prime is 16139562516521. The reversal of 16139562516480 is 8461526593161.
It is a self number, because there is not a number n which added to its sum of digits gives 16139562516480.
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, 99015720879 + ... + 99015721041.
Almost surely, 216139562516480 is an apocalyptic number.
16139562516480 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 16139562516480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28322822599200).
16139562516480 is an abundant number, since it is smaller than the sum of its proper divisors (40506082681920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16139562516480 is an equidigital number, since it uses as much as digits as its factorization.
16139562516480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382 (or 335 counting only the distinct ones).
The product of its (nonzero) digits is 9331200, while the sum is 57.
The spelling of 16139562516480 in words is "sixteen trillion, one hundred thirty-nine billion, five hundred sixty-two million, five hundred sixteen thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •