Base | Representation |
---|---|
bin | 101001111000… |
… | …1111000001000 |
3 | 1112022210112121 |
4 | 1103301320020 |
5 | 21110242443 |
6 | 2102421024 |
7 | 354450610 |
oct | 123617010 |
9 | 45283477 |
10 | 21962248 |
11 | 11440620 |
12 | 7431774 |
13 | 471c619 |
14 | 2cb9a40 |
15 | 1ddc4ed |
hex | 14f1e08 |
21962248 has 64 divisors (see below), whose sum is σ = 51995520. Its totient is φ = 8448000.
The previous prime is 21962209. The next prime is 21962261. The reversal of 21962248 is 84226912.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 62040 + ... + 62392.
It is an arithmetic number, because the mean of its divisors is an integer number (812430).
Almost surely, 221962248 is an apocalyptic number.
21962248 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 21962248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25997760).
21962248 is an abundant number, since it is smaller than the sum of its proper divisors (30033272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21962248 is a wasteful number, since it uses less digits than its factorization.
21962248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478 (or 474 counting only the distinct ones).
The product of its digits is 13824, while the sum is 34.
The square root of 21962248 is about 4686.3896551610. The cubic root of 21962248 is about 280.0435646501.
It can be divided in two parts, 2196 and 2248, that added together give a palindrome (4444).
The spelling of 21962248 in words is "twenty-one million, nine hundred sixty-two thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •