Base | Representation |
---|---|
bin | 111101101011… |
… | …011011000000 |
3 | 1010102110012112 |
4 | 331223123000 |
5 | 13114344030 |
6 | 1334314452 |
7 | 254300615 |
oct | 75533300 |
9 | 33373175 |
10 | 16168640 |
11 | 9143814 |
12 | 54b8a28 |
13 | 3471557 |
14 | 220c50c |
15 | 1645a95 |
hex | f6b6c0 |
16168640 has 28 divisors (see below), whose sum is σ = 38502336. Its totient is φ = 6467328.
The previous prime is 16168591. The next prime is 16168643. The reversal of 16168640 is 4686161.
It is a happy number.
It is a super-2 number, since 2×161686402 = 522849838899200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a nialpdrome in base 8.
It is a junction number, because it is equal to n+sod(n) for n = 16168597 and 16168606.
It is not an unprimeable number, because it can be changed into a prime (16168643) 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 3 ways as a sum of consecutive naturals, for example, 24944 + ... + 25583.
Almost surely, 216168640 is an apocalyptic number.
16168640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16168640 is an abundant number, since it is smaller than the sum of its proper divisors (22333696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16168640 is an equidigital number, since it uses as much as digits as its factorization.
16168640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50544 (or 50534 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 32.
The square root of 16168640 is about 4021.0247450121. The cubic root of 16168640 is about 252.8664222194.
The spelling of 16168640 in words is "sixteen million, one hundred sixty-eight thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •