Base | Representation |
---|---|
bin | 101000010000… |
… | …1000101111000 |
3 | 1110201100110010 |
4 | 1100201011320 |
5 | 20400411224 |
6 | 2032221520 |
7 | 344256426 |
oct | 120410570 |
9 | 43640403 |
10 | 21107064 |
11 | 10a07060 |
12 | 709a8a0 |
13 | 44b02b4 |
14 | 2b36116 |
15 | 1cbde29 |
hex | 1421178 |
21107064 has 64 divisors (see below), whose sum is σ = 60963840. Its totient is φ = 6018560.
The previous prime is 21107029. The next prime is 21107083. The reversal of 21107064 is 46070112.
It is a self number, because there is not a number n which added to its sum of digits gives 21107064.
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, 2137 + ... + 6839.
It is an arithmetic number, because the mean of its divisors is an integer number (952560).
Almost surely, 221107064 is an apocalyptic number.
21107064 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21107064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30481920).
21107064 is an abundant number, since it is smaller than the sum of its proper divisors (39856776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21107064 is a wasteful number, since it uses less digits than its factorization.
21107064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4740 (or 4736 counting only the distinct ones).
The product of its (nonzero) digits is 336, while the sum is 21.
The square root of 21107064 is about 4594.2424838051. The cubic root of 21107064 is about 276.3604825513.
Adding to 21107064 its reverse (46070112), we get a palindrome (67177176).
The spelling of 21107064 in words is "twenty-one million, one hundred seven thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •