Base | Representation |
---|---|
bin | 100110001001… |
… | …1000100110000 |
3 | 1101122011022110 |
4 | 1030103010300 |
5 | 20110013242 |
6 | 1552405320 |
7 | 332002110 |
oct | 114230460 |
9 | 41564273 |
10 | 20001072 |
11 | 10321113 |
12 | 6846840 |
13 | 41b3a70 |
14 | 2929040 |
15 | 1b5139c |
hex | 1313130 |
20001072 has 160 divisors (see below), whose sum is σ = 67217920. Its totient is φ = 4976640.
The previous prime is 20001067. The next prime is 20001073. The reversal of 20001072 is 27010002.
It is a super-2 number, since 2×200010722 = 800085762298368, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001073) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 82872 + ... + 83112.
It is an arithmetic number, because the mean of its divisors is an integer number (420112).
Almost surely, 220001072 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 20001072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (33608960).
20001072 is an abundant number, since it is smaller than the sum of its proper divisors (47216848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001072 is a wasteful number, since it uses less digits than its factorization.
20001072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291 (or 285 counting only the distinct ones).
The product of its (nonzero) digits is 28, while the sum is 12.
The square root of 20001072 is about 4472.2558066372. The cubic root of 20001072 is about 271.4466113323.
Adding to 20001072 its reverse (27010002), we get a palindrome (47011074).
The spelling of 20001072 in words is "twenty million, one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •