Base | Representation |
---|---|
bin | 111101101010… |
… | …100000101000 |
3 | 1010102021002011 |
4 | 331222200220 |
5 | 13114234104 |
6 | 1334245304 |
7 | 254254000 |
oct | 75524050 |
9 | 33367064 |
10 | 16164904 |
11 | 9140a28 |
12 | 54b6834 |
13 | 346c942 |
14 | 220b000 |
15 | 1644904 |
hex | f6a828 |
16164904 has 64 divisors (see below), whose sum is σ = 36432000. Its totient is φ = 6717312.
The previous prime is 16164887. The next prime is 16164913. The reversal of 16164904 is 40946161.
It is a super-2 number, since 2×161649042 = 522608242658432, which contains 22 as substring.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 117924 + ... + 118060.
It is an arithmetic number, because the mean of its divisors is an integer number (569250).
Almost surely, 216164904 is an apocalyptic number.
16164904 is a gapful number since it is divisible by the number (14) 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 16164904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18216000).
16164904 is an abundant number, since it is smaller than the sum of its proper divisors (20267096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16164904 is a wasteful number, since it uses less digits than its factorization.
16164904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207 (or 189 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 16164904 is about 4020.5601599777. The cubic root of 16164904 is about 252.8469445613.
The spelling of 16164904 in words is "sixteen million, one hundred sixty-four thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •