Base | Representation |
---|---|
bin | 100111010100… |
… | …0010000111000 |
3 | 1102210012120001 |
4 | 1032220100320 |
5 | 20234042102 |
6 | 2013442344 |
7 | 340125511 |
oct | 116502070 |
9 | 42705501 |
10 | 20612152 |
11 | 106a9240 |
12 | 6aa03b4 |
13 | 4368c52 |
14 | 2a47a08 |
15 | 1c22487 |
hex | 13a8438 |
20612152 has 32 divisors (see below), whose sum is σ = 42768000. Its totient is φ = 9234400.
The previous prime is 20612149. The next prime is 20612167. The reversal of 20612152 is 25121602.
It is a super-2 number, since 2×206121522 = 849721620142208, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4599 + ... + 7897.
It is an arithmetic number, because the mean of its divisors is an integer number (1336500).
Almost surely, 220612152 is an apocalyptic number.
20612152 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 20612152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21384000).
20612152 is an abundant number, since it is smaller than the sum of its proper divisors (22155848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20612152 is a wasteful number, since it uses less digits than its factorization.
20612152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3387 (or 3383 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
The square root of 20612152 is about 4540.0607925445. The cubic root of 20612152 is about 274.1833713129.
Adding to 20612152 its reverse (25121602), we get a palindrome (45733754).
The spelling of 20612152 in words is "twenty million, six hundred twelve thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •