Base | Representation |
---|---|
bin | 100000000100… |
… | …0110110100000 |
3 | 1011122012202012 |
4 | 1000020312200 |
5 | 13301012342 |
6 | 1400212052 |
7 | 262624604 |
oct | 100106640 |
9 | 34565665 |
10 | 16813472 |
11 | 9544235 |
12 | 576a028 |
13 | 3638c00 |
14 | 2339504 |
15 | 1721b82 |
hex | 1008da0 |
16813472 has 36 divisors (see below), whose sum is σ = 35855190. Its totient is φ = 7757568.
The previous prime is 16813463. The next prime is 16813481. The reversal of 16813472 is 27431861.
It is an interprime number because it is at equal distance from previous prime (16813463) and next prime (16813481).
It can be written as a sum of positive squares in 3 ways, for example, as 5550736 + 11262736 = 2356^2 + 3356^2 .
It is a Harshad number since it is a multiple of its sum of digits (32).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3854 + ... + 6962.
Almost surely, 216813472 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16813472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17927595).
16813472 is an abundant number, since it is smaller than the sum of its proper divisors (19041718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16813472 is a wasteful number, since it uses less digits than its factorization.
16813472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3145 (or 3124 counting only the distinct ones).
The product of its digits is 8064, while the sum is 32.
The square root of 16813472 is about 4100.4233927730. The cubic root of 16813472 is about 256.1842748748.
The spelling of 16813472 in words is "sixteen million, eight hundred thirteen thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •