Base | Representation |
---|---|
bin | 111101011110… |
… | …110101000000 |
3 | 1010022211110000 |
4 | 331132311000 |
5 | 13111221211 |
6 | 1333240000 |
7 | 253664334 |
oct | 75366500 |
9 | 33284400 |
10 | 16117056 |
11 | 9108a8a |
12 | 5493000 |
13 | 3453c27 |
14 | 21d77c4 |
15 | 1635656 |
hex | f5ed40 |
16117056 has 70 divisors (see below), whose sum is σ = 47791370. Its totient is φ = 5370624.
The previous prime is 16117039. The next prime is 16117063. The reversal of 16117056 is 65071161.
It can be written as a sum of positive squares in only one way, i.e., 11451456 + 4665600 = 3384^2 + 2160^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3630 + ... + 6738.
Almost surely, 216117056 is an apocalyptic number.
16117056 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 16117056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23895685).
16117056 is an abundant number, since it is smaller than the sum of its proper divisors (31674314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16117056 is an equidigital number, since it uses as much as digits as its factorization.
16117056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3133 (or 3114 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 16117056 is about 4014.6053355218. The cubic root of 16117056 is about 252.5972229596.
The spelling of 16117056 in words is "sixteen million, one hundred seventeen thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •