Base | Representation |
---|---|
bin | 100110011000… |
… | …1011000011100 |
3 | 1101212110121020 |
4 | 1030301120130 |
5 | 20123001322 |
6 | 1555204140 |
7 | 333030042 |
oct | 114613034 |
9 | 41773536 |
10 | 20125212 |
11 | 103a6408 |
12 | 68a6650 |
13 | 4228413 |
14 | 295c392 |
15 | 1b7805c |
hex | 133161c |
20125212 has 48 divisors (see below), whose sum is σ = 50803200. Its totient is φ = 6176512.
The previous prime is 20125177. The next prime is 20125241. The reversal of 20125212 is 21252102.
It is a junction number, because it is equal to n+sod(n) for n = 20125191 and 20125200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8539 + ... + 10637.
It is an arithmetic number, because the mean of its divisors is an integer number (1058400).
Almost surely, 220125212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20125212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25401600).
20125212 is an abundant number, since it is smaller than the sum of its proper divisors (30677988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20125212 is a wasteful number, since it uses less digits than its factorization.
20125212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2170 (or 2168 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 20125212 is about 4486.1132397656. The cubic root of 20125212 is about 272.0070463861.
Adding to 20125212 its reverse (21252102), we get a palindrome (41377314).
The spelling of 20125212 in words is "twenty million, one hundred twenty-five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.033 sec. • engine limits •