Base | Representation |
---|---|
bin | 101000110000… |
… | …1000000000000 |
3 | 1111012122112020 |
4 | 1101201000000 |
5 | 20432300312 |
6 | 2042001440 |
7 | 346426542 |
oct | 121410000 |
9 | 44178466 |
10 | 21368832 |
11 | 110757a1 |
12 | 71a6280 |
13 | 45724a4 |
14 | 2ba3692 |
15 | 1d2178c |
hex | 1461000 |
21368832 has 104 divisors (see below), whose sum is σ = 59761536. Its totient is φ = 6782976.
The previous prime is 21368821. The next prime is 21368843. The reversal of 21368832 is 23886312.
It is an interprime number because it is at equal distance from previous prime (21368821) and next prime (21368843).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 21368793 and 21368802.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 454633 + ... + 454679.
Almost surely, 221368832 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 21368832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29880768).
21368832 is an abundant number, since it is smaller than the sum of its proper divisors (38392704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21368832 is an equidigital number, since it uses as much as digits as its factorization.
21368832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111 (or 89 counting only the distinct ones).
The product of its digits is 13824, while the sum is 33.
The square root of 21368832 is about 4622.6433996146. The cubic root of 21368832 is about 277.4982582473.
The spelling of 21368832 in words is "twenty-one million, three hundred sixty-eight thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •