Base | Representation |
---|---|
bin | 111111100101… |
… | …100111100000 |
3 | 1011100212210000 |
4 | 333211213200 |
5 | 13231403102 |
6 | 1353140000 |
7 | 261454053 |
oct | 77454740 |
9 | 34325700 |
10 | 16669152 |
11 | 9455865 |
12 | 56ba600 |
13 | 35b8306 |
14 | 22dca9a |
15 | 16e401c |
hex | fe59e0 |
16669152 has 120 divisors (see below), whose sum is σ = 50311800. Its totient is φ = 5412096.
The previous prime is 16669151. The next prime is 16669183. The reversal of 16669152 is 25196661.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16669151) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 152874 + ... + 152982.
It is an arithmetic number, because the mean of its divisors is an integer number (419265).
Almost surely, 216669152 is an apocalyptic number.
16669152 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 16669152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25155900).
16669152 is an abundant number, since it is smaller than the sum of its proper divisors (33642648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16669152 is a wasteful number, since it uses less digits than its factorization.
16669152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190 (or 173 counting only the distinct ones).
The product of its digits is 19440, while the sum is 36.
The square root of 16669152 is about 4082.7872832172. The cubic root of 16669152 is about 255.4491737293.
The spelling of 16669152 in words is "sixteen million, six hundred sixty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •