Base | Representation |
---|---|
bin | 11101111110110111… |
… | …00101110000000000 |
3 | 1112112210120010022000 |
4 | 32333123211300000 |
5 | 230431211121111 |
6 | 11221125344000 |
7 | 1106613460260 |
oct | 167733456000 |
9 | 45483503260 |
10 | 16096582656 |
11 | 6910112880 |
12 | 3152868000 |
13 | 1696aa142b |
14 | ac9b137a0 |
15 | 643222c56 |
hex | 3bf6e5c00 |
16096582656 has 352 divisors, whose sum is σ = 59440949760. Its totient is φ = 4180377600.
The previous prime is 16096582609. The next prime is 16096582661. The reversal of 16096582656 is 65628569061.
16096582656 is a `hidden beast` number, since 1 + 6 + 0 + 9 + 6 + 582 + 6 + 56 = 666.
It is a tau number, because it is divible by the number of its divisors (352).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2125116 + ... + 2132676.
Almost surely, 216096582656 is an apocalyptic number.
16096582656 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 16096582656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29720474880).
16096582656 is an abundant number, since it is smaller than the sum of its proper divisors (43344367104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16096582656 is a wasteful number, since it uses less digits than its factorization.
16096582656 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7608 (or 7584 counting only the distinct ones).
The product of its (nonzero) digits is 4665600, while the sum is 54.
The spelling of 16096582656 in words is "sixteen billion, ninety-six million, five hundred eighty-two thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •