Base | Representation |
---|---|
bin | 101001100000… |
… | …1101101011000 |
3 | 1111221202220100 |
4 | 1103001231120 |
5 | 21032434302 |
6 | 2054255400 |
7 | 352666446 |
oct | 123015530 |
9 | 44852810 |
10 | 21764952 |
11 | 11316370 |
12 | 7357560 |
13 | 4680891 |
14 | 2c67b96 |
15 | 1d9dd1c |
hex | 14c1b58 |
21764952 has 48 divisors (see below), whose sum is σ = 64307880. Its totient is φ = 6595200.
The previous prime is 21764933. The next prime is 21764959. The reversal of 21764952 is 25946712.
21764952 is a `hidden beast` number, since 2 + 1 + 7 + 649 + 5 + 2 = 666.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21764959) 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 11 ways as a sum of consecutive naturals, for example, 12949 + ... + 14532.
Almost surely, 221764952 is an apocalyptic number.
21764952 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21764952 is an abundant number, since it is smaller than the sum of its proper divisors (42542928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21764952 is a wasteful number, since it uses less digits than its factorization.
21764952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27504 (or 27497 counting only the distinct ones).
The product of its digits is 30240, while the sum is 36.
The square root of 21764952 is about 4665.2922738024. The cubic root of 21764952 is about 279.2024583599.
The spelling of 21764952 in words is "twenty-one million, seven hundred sixty-four thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •