Base | Representation |
---|---|
bin | 111110101010… |
… | …011000001101 |
3 | 1010220112221020 |
4 | 332222120031 |
5 | 13201122014 |
6 | 1344024353 |
7 | 256423461 |
oct | 76523015 |
9 | 33815836 |
10 | 16426509 |
11 | 92aa530 |
12 | 56020b9 |
13 | 3531a38 |
14 | 22784a1 |
15 | 16971a9 |
hex | faa60d |
16426509 has 8 divisors (see below), whose sum is σ = 23893152. Its totient is φ = 9955440.
The previous prime is 16426493. The next prime is 16426513. The reversal of 16426509 is 90562461.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16426509 - 24 = 16426493 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 497773 = 16426509 / (1 + 6 + 4 + 2 + 6 + 5 + 0 + 9).
It is a self number, because there is not a number n which added to its sum of digits gives 16426509.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16426589) 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 7 ways as a sum of consecutive naturals, for example, 248854 + ... + 248919.
It is an arithmetic number, because the mean of its divisors is an integer number (2986644).
Almost surely, 216426509 is an apocalyptic number.
It is an amenable number.
16426509 is a deficient number, since it is larger than the sum of its proper divisors (7466643).
16426509 is a wasteful number, since it uses less digits than its factorization.
16426509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 497787.
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 16426509 is about 4052.9629902085. The cubic root of 16426509 is about 254.2036362719.
The spelling of 16426509 in words is "sixteen million, four hundred twenty-six thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •