Base | Representation |
---|---|
bin | 101000001011… |
… | …1100101000000 |
3 | 1110122100222212 |
4 | 1100113211000 |
5 | 20343134341 |
6 | 2031321252 |
7 | 344035010 |
oct | 120274500 |
9 | 43570885 |
10 | 21068096 |
11 | 1098a855 |
12 | 7080228 |
13 | 449863a |
14 | 2b25c40 |
15 | 1cb25eb |
hex | 1417940 |
21068096 has 112 divisors (see below), whose sum is σ = 51889152. Its totient is φ = 8294400.
The previous prime is 21068087. The next prime is 21068101. The reversal of 21068096 is 69086012.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 513836 + ... + 513876.
It is an arithmetic number, because the mean of its divisors is an integer number (463296).
Almost surely, 221068096 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 21068096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25944576).
21068096 is an abundant number, since it is smaller than the sum of its proper divisors (30821056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21068096 is a wasteful number, since it uses less digits than its factorization.
21068096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 128 (or 118 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 32.
The square root of 21068096 is about 4589.9995642701. Note that the first 3 decimals coincide. The cubic root of 21068096 is about 276.1903049354.
21068096 divided by its sum of digits (32) gives a triangular number (658378 = T1147).
The spelling of 21068096 in words is "twenty-one million, sixty-eight thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •