Base | Representation |
---|---|
bin | 11111000111000010… |
… | …00111101111110100 |
3 | 1121002222210010210000 |
4 | 33203201013233310 |
5 | 233201203344104 |
6 | 11401154031300 |
7 | 1130614522500 |
oct | 174341075764 |
9 | 47088703700 |
10 | 16702012404 |
11 | 70a093a140 |
12 | 32a1578530 |
13 | 176234b59c |
14 | b462b1300 |
15 | 67b464639 |
hex | 3e3847bf4 |
16702012404 has 360 divisors, whose sum is σ = 56382147360. Its totient is φ = 4262025600.
The previous prime is 16702012391. The next prime is 16702012409. The reversal of 16702012404 is 40421020761.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16702012409) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 10302714 + ... + 10304334.
It is an arithmetic number, because the mean of its divisors is an integer number (156617076).
Almost surely, 216702012404 is an apocalyptic number.
16702012404 is a gapful number since it is divisible by the number (14) 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 16702012404, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28191073680).
16702012404 is an abundant number, since it is smaller than the sum of its proper divisors (39680134956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16702012404 is a wasteful number, since it uses less digits than its factorization.
16702012404 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1721 (or 1703 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The spelling of 16702012404 in words is "sixteen billion, seven hundred two million, twelve thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •