Base | Representation |
---|---|
bin | 100000010100… |
… | …0111000101001 |
3 | 1011212212201210 |
4 | 1000220320221 |
5 | 13314212211 |
6 | 1403103333 |
7 | 264012255 |
oct | 100507051 |
9 | 34785653 |
10 | 16944681 |
11 | 9623876 |
12 | 5811b49 |
13 | 3683850 |
14 | 2371265 |
15 | 174a9a6 |
hex | 1028e29 |
16944681 has 8 divisors (see below), whose sum is σ = 24330880. Its totient is φ = 10427472.
The previous prime is 16944679. The next prime is 16944691. The reversal of 16944681 is 18644961.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16944681 - 21 = 16944679 is a prime.
It is a super-2 number, since 2×169446812 = 574244428383522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 434479 = 16944681 / (1 + 6 + 9 + 4 + 4 + 6 + 8 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16944691) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 217201 + ... + 217278.
It is an arithmetic number, because the mean of its divisors is an integer number (3041360).
Almost surely, 216944681 is an apocalyptic number.
It is an amenable number.
16944681 is a deficient number, since it is larger than the sum of its proper divisors (7386199).
16944681 is a wasteful number, since it uses less digits than its factorization.
16944681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 434495.
The product of its digits is 41472, while the sum is 39.
The square root of 16944681 is about 4116.3917452060. The cubic root of 16944681 is about 256.8489526101.
It can be divided in two parts, 169 and 44681, that added together give a triangular number (44850 = T299).
The spelling of 16944681 in words is "sixteen million, nine hundred forty-four thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •