Base | Representation |
---|---|
bin | 11110100011111111… |
… | …10101001010000100 |
3 | 1120100111200110111100 |
4 | 33101333311022010 |
5 | 232100431312321 |
6 | 11312053540100 |
7 | 1120415214021 |
oct | 172177651204 |
9 | 46314613440 |
10 | 16408072836 |
11 | 6a5aa24a81 |
12 | 321b044630 |
13 | 171649314c |
14 | b19238548 |
15 | 660751326 |
hex | 3d1ff5284 |
16408072836 has 81 divisors (see below), whose sum is σ = 42701235759. Its totient is φ = 5312314368.
The previous prime is 16408072823. The next prime is 16408072843. The reversal of 16408072836 is 63827080461.
The square root of 16408072836 is 128094.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 13757882436 + 2650190400 = 117294^2 + 51480^2 .
It is a junction number, because it is equal to n+sod(n) for n = 16408072791 and 16408072800.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 28436580 + ... + 28437156.
Almost surely, 216408072836 is an apocalyptic number.
16408072836 is the 128094-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16408072836
16408072836 is an abundant number, since it is smaller than the sum of its proper divisors (26293162923).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16408072836 is an equidigital number, since it uses as much as digits as its factorization.
16408072836 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1238 (or 619 counting only the distinct ones).
The product of its (nonzero) digits is 387072, while the sum is 45.
The spelling of 16408072836 in words is "sixteen billion, four hundred eight million, seventy-two thousand, eight hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •