Base | Representation |
---|---|
bin | 11101110011101100… |
… | …11010001000000000 |
3 | 1112022021101001221020 |
4 | 32321312122020000 |
5 | 230233223342012 |
6 | 11203542425440 |
7 | 1104365553555 |
oct | 167166321000 |
9 | 45267331836 |
10 | 16002949632 |
11 | 687227aa0a |
12 | 3127432280 |
13 | 1680579987 |
14 | abb4dca2c |
15 | 639dc9a8c |
hex | 3b9d9a200 |
16002949632 has 80 divisors (see below), whose sum is σ = 42744049920. Its totient is φ = 5320404992.
The previous prime is 16002949631. The next prime is 16002949667. The reversal of 16002949632 is 23694920061.
It is not an unprimeable number, because it can be changed into a prime (16002949631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 584113 + ... + 610895.
It is an arithmetic number, because the mean of its divisors is an integer number (534300624).
Almost surely, 216002949632 is an apocalyptic number.
16002949632 is a gapful number since it is divisible by the number (12) 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 16002949632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21372024960).
16002949632 is an abundant number, since it is smaller than the sum of its proper divisors (26741100288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16002949632 is an equidigital number, since it uses as much as digits as its factorization.
16002949632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27193 (or 27177 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 42.
The spelling of 16002949632 in words is "sixteen billion, two million, nine hundred forty-nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.963 sec. • engine limits •