Base | Representation |
---|---|
bin | 111111100111… |
… | …000100000000 |
3 | 1011101011220021 |
4 | 333213010000 |
5 | 13232100242 |
6 | 1353223224 |
7 | 261510241 |
oct | 77470400 |
9 | 34334807 |
10 | 16675072 |
11 | 945a257 |
12 | 5701b14 |
13 | 35bac0b |
14 | 2300cc8 |
15 | 16e5b67 |
hex | fe7100 |
16675072 has 36 divisors (see below), whose sum is σ = 33940620. Its totient is φ = 8173568.
The previous prime is 16675067. The next prime is 16675073. The reversal of 16675072 is 27057661.
It can be written as a sum of positive squares in 2 ways, for example, as 14868736 + 1806336 = 3856^2 + 1344^2 .
It is a nialpdrome in base 16.
It is not an unprimeable number, because it can be changed into a prime (16675073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12954 + ... + 14182.
It is an arithmetic number, because the mean of its divisors is an integer number (942795).
Almost surely, 216675072 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16675072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16970310).
16675072 is an abundant number, since it is smaller than the sum of its proper divisors (17265548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16675072 is an equidigital number, since it uses as much as digits as its factorization.
16675072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1298 (or 1284 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 34.
The square root of 16675072 is about 4083.5122137689. The cubic root of 16675072 is about 255.4794108227.
The spelling of 16675072 in words is "sixteen million, six hundred seventy-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •