Base | Representation |
---|---|
bin | 101001101011… |
… | …0000000000000 |
3 | 1112002222220120 |
4 | 1103112000000 |
5 | 21043114224 |
6 | 2100140240 |
7 | 353463660 |
oct | 123260000 |
9 | 45088816 |
10 | 21848064 |
11 | 11372857 |
12 | 7397680 |
13 | 46ac664 |
14 | 2c8a1a0 |
15 | 1db8779 |
hex | 14d6000 |
21848064 has 112 divisors (see below), whose sum is σ = 67104768. Its totient is φ = 6193152.
The previous prime is 21848063. The next prime is 21848083. The reversal of 21848064 is 46084812.
It is a tau number, because it is divible by the number of its divisors (112).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21848063) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 171969 + ... + 172095.
Almost surely, 221848064 is an apocalyptic number.
21848064 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 21848064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33552384).
21848064 is an abundant number, since it is smaller than the sum of its proper divisors (45256704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21848064 is an equidigital number, since it uses as much as digits as its factorization.
21848064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163 (or 139 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 33.
The square root of 21848064 is about 4674.1912669466. The cubic root of 21848064 is about 279.5573959699.
The spelling of 21848064 in words is "twenty-one million, eight hundred forty-eight thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •