Base | Representation |
---|---|
bin | 111111011010… |
… | …001000101000 |
3 | 1011021111021002 |
4 | 333122020220 |
5 | 13223401440 |
6 | 1352134132 |
7 | 261166664 |
oct | 77321050 |
9 | 34244232 |
10 | 16622120 |
11 | 9423499 |
12 | 5697348 |
13 | 359ca98 |
14 | 22c98a4 |
15 | 16d5115 |
hex | fda228 |
16622120 has 16 divisors (see below), whose sum is σ = 37399860. Its totient is φ = 6648832.
The previous prime is 16622117. The next prime is 16622147. The reversal of 16622120 is 2122661.
It is a happy number.
16622120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 16370116 + 252004 = 4046^2 + 502^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 16622092 and 16622101.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 207737 + ... + 207816.
Almost surely, 216622120 is an apocalyptic number.
16622120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
16622120 is an abundant number, since it is smaller than the sum of its proper divisors (20777740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16622120 is a wasteful number, since it uses less digits than its factorization.
16622120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 415564 (or 415560 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 16622120 is about 4077.0234240190. The cubic root of 16622120 is about 255.2086975348.
Adding to 16622120 its reverse (2122661), we get a palindrome (18744781).
The spelling of 16622120 in words is "sixteen million, six hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •