Base | Representation |
---|---|
bin | 101000011010… |
… | …0010110011100 |
3 | 1110212100122202 |
4 | 1100310112130 |
5 | 20410422243 |
6 | 2034031032 |
7 | 345035420 |
oct | 120642634 |
9 | 43770582 |
10 | 21185948 |
11 | 10a60353 |
12 | 7118478 |
13 | 450a184 |
14 | 2b56b80 |
15 | 1cd74b8 |
hex | 143459c |
21185948 has 12 divisors (see below), whose sum is σ = 42371952. Its totient is φ = 9079680.
The previous prime is 21185947. The next prime is 21185953. The reversal of 21185948 is 84958112.
21185948 is an admirable number.
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21185947) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 378293 + ... + 378348.
It is an arithmetic number, because the mean of its divisors is an integer number (3530996).
Almost surely, 221185948 is an apocalyptic number.
21185948 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
21185948 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21185948 is a wasteful number, since it uses less digits than its factorization.
21185948 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 756652 (or 756650 counting only the distinct ones).
The product of its digits is 23040, while the sum is 38.
The square root of 21185948 is about 4602.8195706545. The cubic root of 21185948 is about 276.7043377036.
The spelling of 21185948 in words is "twenty-one million, one hundred eighty-five thousand, nine hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •