Base | Representation |
---|---|
bin | 11110110101101100… |
… | …10000111010110010 |
3 | 1120201212002101122210 |
4 | 33122312100322302 |
5 | 232401434410200 |
6 | 11334520312550 |
7 | 1124200303242 |
oct | 173266207262 |
9 | 46655071583 |
10 | 16556560050 |
11 | 7026823688 |
12 | 3260912756 |
13 | 173b1825c4 |
14 | b30c4bb22 |
15 | 66d7d2650 |
hex | 3dad90eb2 |
16556560050 has 24 divisors (see below), whose sum is σ = 41060269296. Its totient is φ = 4415082640.
The previous prime is 16556560019. The next prime is 16556560093. The reversal of 16556560050 is 5006565561.
It is a junction number, because it is equal to n+sod(n) for n = 16556559990 and 16556560008.
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 11 ways as a sum of consecutive naturals, for example, 55188384 + ... + 55188683.
It is an arithmetic number, because the mean of its divisors is an integer number (1710844554).
Almost surely, 216556560050 is an apocalyptic number.
16556560050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16556560050 is an abundant number, since it is smaller than the sum of its proper divisors (24503709246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16556560050 is a wasteful number, since it uses less digits than its factorization.
16556560050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110377082 (or 110377077 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 16556560050 in words is "sixteen billion, five hundred fifty-six million, five hundred sixty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •