Base | Representation |
---|---|
bin | 11111011101010110… |
… | …01011001011000000 |
3 | 1121121001000010010000 |
4 | 33232223023023000 |
5 | 234042113302443 |
6 | 11431522040000 |
7 | 1135346544060 |
oct | 175653131300 |
9 | 47531003100 |
10 | 16889197248 |
11 | 7187569960 |
12 | 33341a9000 |
13 | 1792069851 |
14 | b630b93a0 |
15 | 68cadb8d3 |
hex | 3eeacb2c0 |
16889197248 has 560 divisors, whose sum is σ = 64615161600. Its totient is φ = 4232632320.
The previous prime is 16889197211. The next prime is 16889197289. The reversal of 16889197248 is 84279198861.
It is a Smith number, since the sum of its digits (63) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a nude number because it is divisible by every one of its digits.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 11575143 + ... + 11576601.
Almost surely, 216889197248 is an apocalyptic number.
16889197248 is a gapful number since it is divisible by the number (18) 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 16889197248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32307580800).
16889197248 is an abundant number, since it is smaller than the sum of its proper divisors (47725964352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16889197248 is a wasteful number, since it uses less digits than its factorization.
16889197248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1530 (or 1511 counting only the distinct ones).
The product of its digits is 13934592, while the sum is 63.
The spelling of 16889197248 in words is "sixteen billion, eight hundred eighty-nine million, one hundred ninety-seven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •