Base | Representation |
---|---|
bin | 11101111001101000… |
… | …01101101001000000 |
3 | 1112102201222221122100 |
4 | 32330310031221000 |
5 | 230333443041411 |
6 | 11212521110400 |
7 | 1105541514465 |
oct | 167464155100 |
9 | 45381887570 |
10 | 16052705856 |
11 | 6898374560 |
12 | 3140028400 |
13 | 168a97b125 |
14 | ac3d7166c |
15 | 63e457456 |
hex | 3bcd0da40 |
16052705856 has 168 divisors, whose sum is σ = 50372247744. Its totient is φ = 4847293440.
The previous prime is 16052705831. The next prime is 16052705857. The reversal of 16052705856 is 65850725061.
16052705856 is a `hidden beast` number, since 1 + 60 + 5 + 2 + 7 + 0 + 585 + 6 = 666.
It is not an unprimeable number, because it can be changed into a prime (16052705857) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1852125 + ... + 1860771.
It is an arithmetic number, because the mean of its divisors is an integer number (299834808).
Almost surely, 216052705856 is an apocalyptic number.
16052705856 is a gapful number since it is divisible by the number (16) 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 16052705856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25186123872).
16052705856 is an abundant number, since it is smaller than the sum of its proper divisors (34319541888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16052705856 is a wasteful number, since it uses less digits than its factorization.
16052705856 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8969 (or 8956 counting only the distinct ones).
The product of its (nonzero) digits is 504000, while the sum is 45.
The spelling of 16052705856 in words is "sixteen billion, fifty-two million, seven hundred five thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •