Base | Representation |
---|---|
bin | 111111011011… |
… | …100100100000 |
3 | 1011021210022212 |
4 | 333123210200 |
5 | 13224044000 |
6 | 1352221252 |
7 | 261223064 |
oct | 77334440 |
9 | 34253285 |
10 | 16628000 |
11 | 9427954 |
12 | 569a828 |
13 | 35a266c |
14 | 22cbaa4 |
15 | 16d6c35 |
hex | fdb920 |
16628000 has 48 divisors (see below), whose sum is σ = 40864824. Its totient is φ = 6649600.
The previous prime is 16627981. The next prime is 16628009. The reversal of 16628000 is 82661.
It can be written as a sum of positive squares in 4 ways, for example, as 4545424 + 12082576 = 2132^2 + 3476^2 .
It is a nialpdrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (16628009) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1922 + ... + 6078.
Almost surely, 216628000 is an apocalyptic number.
16628000 is a gapful number since it is divisible by the number (10) 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 16628000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20432412).
16628000 is an abundant number, since it is smaller than the sum of its proper divisors (24236824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16628000 is an equidigital number, since it uses as much as digits as its factorization.
16628000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4182 (or 4164 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
The square root of 16628000 is about 4077.7444745840. The cubic root of 16628000 is about 255.2387869624.
The spelling of 16628000 in words is "sixteen million, six hundred twenty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •