Base | Representation |
---|---|
bin | 100111010100… |
… | …0001110111001 |
3 | 1102210012101100 |
4 | 1032220032321 |
5 | 20234041100 |
6 | 2013442013 |
7 | 340125240 |
oct | 116501671 |
9 | 42705340 |
10 | 20612025 |
11 | 106a9135 |
12 | 6aa0309 |
13 | 4368b85 |
14 | 2a47957 |
15 | 1c22400 |
hex | 13a83b9 |
20612025 has 72 divisors (see below), whose sum is σ = 44104320. Its totient is φ = 8997120.
The previous prime is 20612021. The next prime is 20612027. The reversal of 20612025 is 52021602.
It is not a de Polignac number, because 20612025 - 22 = 20612021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20611989 and 20612007.
It is not an unprimeable number, because it can be changed into a prime (20612021) 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 71 ways as a sum of consecutive naturals, for example, 35941 + ... + 36509.
It is an arithmetic number, because the mean of its divisors is an integer number (612560).
Almost surely, 220612025 is an apocalyptic number.
20612025 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
20612025 is an abundant number, since it is smaller than the sum of its proper divisors (23492295).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20612025 is a wasteful number, since it uses less digits than its factorization.
20612025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 615 (or 607 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 20612025 is about 4540.0468059261. The cubic root of 20612025 is about 274.1828081926.
Adding to 20612025 its reverse (52021602), we get a palindrome (72633627).
The spelling of 20612025 in words is "twenty million, six hundred twelve thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •