Base | Representation |
---|---|
bin | 100000010111… |
… | …1010000110101 |
3 | 1011221012120100 |
4 | 1000233100311 |
5 | 13321031210 |
6 | 1403424313 |
7 | 264151365 |
oct | 100572065 |
9 | 34835510 |
10 | 16970805 |
11 | 9641465 |
12 | 5825099 |
13 | 36926c7 |
14 | 237a9a5 |
15 | 17535c0 |
hex | 102f435 |
16970805 has 12 divisors (see below), whose sum is σ = 29416140. Its totient is φ = 9051072.
The previous prime is 16970801. The next prime is 16970813. The reversal of 16970805 is 50807961.
It can be written as a sum of positive squares in 2 ways, for example, as 9696996 + 7273809 = 3114^2 + 2697^2 .
It is not a de Polignac number, because 16970805 - 22 = 16970801 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16970805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16970801) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 188520 + ... + 188609.
It is an arithmetic number, because the mean of its divisors is an integer number (2451345).
Almost surely, 216970805 is an apocalyptic number.
16970805 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
16970805 is a deficient number, since it is larger than the sum of its proper divisors (12445335).
16970805 is a wasteful number, since it uses less digits than its factorization.
16970805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377140 (or 377137 counting only the distinct ones).
The product of its (nonzero) digits is 15120, while the sum is 36.
The square root of 16970805 is about 4119.5636904896. The cubic root of 16970805 is about 256.9808814577.
The spelling of 16970805 in words is "sixteen million, nine hundred seventy thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •