Base | Representation |
---|---|
bin | 101000101000… |
… | …0111001000000 |
3 | 1111002022000101 |
4 | 1101100321000 |
5 | 20423142343 |
6 | 2040332144 |
7 | 346033300 |
oct | 121207100 |
9 | 44068011 |
10 | 21302848 |
11 | 11030166 |
12 | 7174054 |
13 | 454b448 |
14 | 2b87600 |
15 | 1d0be4d |
hex | 1450e40 |
21302848 has 42 divisors (see below), whose sum is σ = 49181766. Its totient is φ = 9128448.
The previous prime is 21302837. The next prime is 21302881. The reversal of 21302848 is 84820312.
It can be written as a sum of positive squares in only one way, i.e., 14077504 + 7225344 = 3752^2 + 2688^2 .
It is a super-2 number, since 2×213028482 = 907622665822208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 261 + ... + 6532.
Almost surely, 221302848 is an apocalyptic number.
21302848 is a gapful number since it is divisible by the number (28) 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 21302848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24590883).
21302848 is an abundant number, since it is smaller than the sum of its proper divisors (27878918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21302848 is an equidigital number, since it uses as much as digits as its factorization.
21302848 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6819 (or 6802 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 28.
The square root of 21302848 is about 4615.5008395623. The cubic root of 21302848 is about 277.2123383278.
The spelling of 21302848 in words is "twenty-one million, three hundred two thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •