Base | Representation |
---|---|
bin | 100111011010… |
… | …0010010111000 |
3 | 1102212201011020 |
4 | 1032310102320 |
5 | 20242131212 |
6 | 2014502440 |
7 | 340422261 |
oct | 116642270 |
9 | 42781136 |
10 | 20661432 |
11 | 10732270 |
12 | 6b04a20 |
13 | 43854cc |
14 | 2a5b968 |
15 | 1c31d8c |
hex | 13b44b8 |
20661432 has 64 divisors (see below), whose sum is σ = 57317760. Its totient is φ = 6153600.
The previous prime is 20661419. The next prime is 20661437. The reversal of 20661432 is 23416602.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20661437) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15463 + ... + 16745.
It is an arithmetic number, because the mean of its divisors is an integer number (895590).
Almost surely, 220661432 is an apocalyptic number.
20661432 is a gapful number since it is divisible by the number (22) 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 20661432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28658880).
20661432 is an abundant number, since it is smaller than the sum of its proper divisors (36656328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20661432 is a wasteful number, since it uses less digits than its factorization.
20661432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1364 (or 1360 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
The square root of 20661432 is about 4545.4847926266. The cubic root of 20661432 is about 274.4017053446.
The spelling of 20661432 in words is "twenty million, six hundred sixty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •