Base | Representation |
---|---|
bin | 100111111100… |
… | …0011101000100 |
3 | 1110101220010020 |
4 | 1033320131010 |
5 | 20330044422 |
6 | 2024455140 |
7 | 342664230 |
oct | 117703504 |
9 | 43356106 |
10 | 20940612 |
11 | 10902aa0 |
12 | 701a4b0 |
13 | 44525c4 |
14 | 2ad15c0 |
15 | 1c8995c |
hex | 13f8744 |
20940612 has 96 divisors (see below), whose sum is σ = 61737984. Its totient is φ = 5366400.
The previous prime is 20940611. The next prime is 20940637. The reversal of 20940612 is 21604902.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20940611) 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 31 ways as a sum of consecutive naturals, for example, 120958 + ... + 121130.
It is an arithmetic number, because the mean of its divisors is an integer number (643104).
Almost surely, 220940612 is an apocalyptic number.
20940612 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 20940612, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30868992).
20940612 is an abundant number, since it is smaller than the sum of its proper divisors (40797372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20940612 is a wasteful number, since it uses less digits than its factorization.
20940612 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329 (or 327 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
The square root of 20940612 is about 4576.0913452421. The cubic root of 20940612 is about 275.6320975029.
The spelling of 20940612 in words is "twenty million, nine hundred forty thousand, six hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •