Base | Representation |
---|---|
bin | 11110111100000101… |
… | …00001110010111000 |
3 | 1120212120211211122120 |
4 | 33132002201302320 |
5 | 233004141402202 |
6 | 11344112121240 |
7 | 1125420401424 |
oct | 173602416270 |
9 | 46776754576 |
10 | 16610106552 |
11 | 7053a76996 |
12 | 3276836220 |
13 | 17492b0020 |
14 | b37dc9b84 |
15 | 67335d0bc |
hex | 3de0a1cb8 |
16610106552 has 64 divisors (see below), whose sum is σ = 44885988000. Its totient is φ = 5091777024.
The previous prime is 16610106533. The next prime is 16610106589. The reversal of 16610106552 is 25560101661.
16610106552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15027 + ... + 182882.
Almost surely, 216610106552 is an apocalyptic number.
16610106552 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 16610106552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22442994000).
16610106552 is an abundant number, since it is smaller than the sum of its proper divisors (28275881448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16610106552 is a wasteful number, since it uses less digits than its factorization.
16610106552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198200 (or 198196 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 33.
The spelling of 16610106552 in words is "sixteen billion, six hundred ten million, one hundred six thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •