Base | Representation |
---|---|
bin | 111110101010… |
… | …110110111101 |
3 | 1010220122122010 |
4 | 332222312331 |
5 | 13201202402 |
6 | 1344041433 |
7 | 256432302 |
oct | 76526675 |
9 | 33818563 |
10 | 16428477 |
11 | 9300a5a |
12 | 5603279 |
13 | 35328c0 |
14 | 22790a9 |
15 | 1697a6c |
hex | faadbd |
16428477 has 32 divisors (see below), whose sum is σ = 25401600. Its totient is φ = 9354240.
The previous prime is 16428449. The next prime is 16428487. The reversal of 16428477 is 77482461.
It is not a de Polignac number, because 16428477 - 28 = 16428221 is a prime.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16428437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 46899 + ... + 47247.
It is an arithmetic number, because the mean of its divisors is an integer number (793800).
Almost surely, 216428477 is an apocalyptic number.
16428477 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
16428477 is a deficient number, since it is larger than the sum of its proper divisors (8973123).
16428477 is a wasteful number, since it uses less digits than its factorization.
16428477 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 453.
The product of its digits is 75264, while the sum is 39.
The square root of 16428477 is about 4053.2057682777. The cubic root of 16428477 is about 254.2137876026.
The spelling of 16428477 in words is "sixteen million, four hundred twenty-eight thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •