Base | Representation |
---|---|
bin | 11110110101101111… |
… | …01010001000001010 |
3 | 1120201212202221220010 |
4 | 33122313222020022 |
5 | 232402033103300 |
6 | 11334532212350 |
7 | 1124203354452 |
oct | 173267521012 |
9 | 46655687803 |
10 | 16556925450 |
11 | 7026a5316a |
12 | 3260a6a0b6 |
13 | 173b27ca10 |
14 | b30d04d62 |
15 | 66d855a50 |
hex | 3dadea20a |
16556925450 has 144 divisors (see below), whose sum is σ = 45333535968. Its totient is φ = 3975360000.
The previous prime is 16556925433. The next prime is 16556925457. The reversal of 16556925450 is 5452965561.
It is a self number, because there is not a number n which added to its sum of digits gives 16556925450.
It is not an unprimeable number, because it can be changed into a prime (16556925457) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 3275425 + ... + 3280475.
It is an arithmetic number, because the mean of its divisors is an integer number (314816222).
Almost surely, 216556925450 is an apocalyptic number.
16556925450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 16556925450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22666767984).
16556925450 is an abundant number, since it is smaller than the sum of its proper divisors (28776610518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16556925450 is a wasteful number, since it uses less digits than its factorization.
16556925450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5161 (or 5115 counting only the distinct ones).
The product of its (nonzero) digits is 1620000, while the sum is 48.
The spelling of 16556925450 in words is "sixteen billion, five hundred fifty-six million, nine hundred twenty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •