Base | Representation |
---|---|
bin | 100110001100… |
… | …0111001111100 |
3 | 1101200101002001 |
4 | 1030120321330 |
5 | 20111244311 |
6 | 1553112044 |
7 | 332131540 |
oct | 114307174 |
9 | 41611061 |
10 | 20024956 |
11 | 10338056 |
12 | 6858624 |
13 | 41c18b3 |
14 | 2933a20 |
15 | 1b584c1 |
hex | 1318e7c |
20024956 has 24 divisors (see below), whose sum is σ = 40410720. Its totient is φ = 8504832.
The previous prime is 20024887. The next prime is 20024959. The reversal of 20024956 is 65942002.
20024956 is a nontrivial binomial coefficient, being equal to C(6329, 2).
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20024959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1 + ... + 6328.
It is an arithmetic number, because the mean of its divisors is an integer number (1683780).
Almost surely, 220024956 is an apocalyptic number.
20024956 is the 6328-th triangular number.
20024956 is the 2110-th centered nonagonal number.
It is an amenable number.
20024956 is an abundant number, since it is smaller than the sum of its proper divisors (20385764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20024956 is a wasteful number, since it uses less digits than its factorization.
20024956 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6453 (or 6451 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 20024956 is about 4474.9252507724. The cubic root of 20024956 is about 271.5546164092.
Adding to 20024956 its reverse (65942002), we get a palindrome (85966958).
The spelling of 20024956 in words is "twenty million, twenty-four thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •