Base | Representation |
---|---|
bin | 100000011001… |
… | …0001011011101 |
3 | 1011221210221201 |
4 | 1000302023131 |
5 | 13321421444 |
6 | 1403555501 |
7 | 264231250 |
oct | 100621335 |
9 | 34853851 |
10 | 16982749 |
11 | 964a433 |
12 | 582bb91 |
13 | 3697c84 |
14 | 2381097 |
15 | 1756dd4 |
hex | 10322dd |
16982749 has 4 divisors (see below), whose sum is σ = 19408864. Its totient is φ = 14556636.
The previous prime is 16982747. The next prime is 16982753. The reversal of 16982749 is 94728961.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 94728961 = 73 ⋅1297657.
It is a cyclic number.
It is not a de Polignac number, because 16982749 - 21 = 16982747 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16982699 and 16982708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16982747) 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 3 ways as a sum of consecutive naturals, for example, 1213047 + ... + 1213060.
It is an arithmetic number, because the mean of its divisors is an integer number (4852216).
Almost surely, 216982749 is an apocalyptic number.
It is an amenable number.
16982749 is a deficient number, since it is larger than the sum of its proper divisors (2426115).
16982749 is an equidigital number, since it uses as much as digits as its factorization.
16982749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2426114.
The product of its digits is 217728, while the sum is 46.
The square root of 16982749 is about 4121.0131035948. The cubic root of 16982749 is about 257.0411547693.
The spelling of 16982749 in words is "sixteen million, nine hundred eighty-two thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •