Base | Representation |
---|---|
bin | 100000000100… |
… | …0101101000000 |
3 | 1011122011220200 |
4 | 1000020231000 |
5 | 13301002424 |
6 | 1400205200 |
7 | 262623045 |
oct | 100105500 |
9 | 34564820 |
10 | 16812864 |
11 | 9543832 |
12 | 5769800 |
13 | 3638853 |
14 | 23391cc |
15 | 17218c9 |
hex | 1008b40 |
16812864 has 126 divisors (see below), whose sum is σ = 51699414. Its totient is φ = 5222400.
The previous prime is 16812833. The next prime is 16812877. The reversal of 16812864 is 46821861.
It can be written as a sum of positive squares in 3 ways, for example, as 11614464 + 5198400 = 3408^2 + 2280^2 .
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 166414 + ... + 166514.
Almost surely, 216812864 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 16812864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25849707).
16812864 is an abundant number, since it is smaller than the sum of its proper divisors (34886550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16812864 is a wasteful number, since it uses less digits than its factorization.
16812864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153 (or 123 counting only the distinct ones).
The product of its digits is 18432, while the sum is 36.
The square root of 16812864 is about 4100.3492534173. The cubic root of 16812864 is about 256.1811868369.
The spelling of 16812864 in words is "sixteen million, eight hundred twelve thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •