Base | Representation |
---|---|
bin | 100000001011… |
… | …0110100000000 |
3 | 1011202010012010 |
4 | 1000112310000 |
5 | 13304330111 |
6 | 1401332520 |
7 | 263253405 |
oct | 100266400 |
9 | 34663163 |
10 | 16870656 |
11 | 95831a0 |
12 | 5797140 |
13 | 3658c4a |
14 | 23522ac |
15 | 1733aa6 |
hex | 1016d00 |
16870656 has 72 divisors (see below), whose sum is σ = 49006944. Its totient is φ = 5109760.
The previous prime is 16870649. The next prime is 16870657. The reversal of 16870656 is 65607861.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16870657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7450 + ... + 9446.
It is an arithmetic number, because the mean of its divisors is an integer number (680652).
Almost surely, 216870656 is an apocalyptic number.
16870656 is a gapful number since it is divisible by the number (16) 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 16870656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24503472).
16870656 is an abundant number, since it is smaller than the sum of its proper divisors (32136288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16870656 is a wasteful number, since it uses less digits than its factorization.
16870656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2027 (or 2013 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 39.
The square root of 16870656 is about 4107.3904124152. The cubic root of 16870656 is about 256.4743808223.
The spelling of 16870656 in words is "sixteen million, eight hundred seventy thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •