Base | Representation |
---|---|
bin | 111011101000101… |
… | …0010010011010000 |
3 | 12011110021100120000 |
4 | 1313101102103100 |
5 | 13044230120422 |
6 | 530320450000 |
7 | 100405250610 |
oct | 16721222320 |
9 | 5143240500 |
10 | 2001020112 |
11 | 937584033 |
12 | 47a179900 |
13 | 25b743790 |
14 | 14da82a40 |
15 | baa14cac |
hex | 774524d0 |
2001020112 has 600 divisors, whose sum is σ = 7683008256. Its totient is φ = 489328128.
The previous prime is 2001020101. The next prime is 2001020117. The reversal of 2001020112 is 2110201002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 2001020094 and 2001020103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2001020117) by changing a digit.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 42574873 + ... + 42574919.
Almost surely, 22001020112 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 2001020112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3841504128).
2001020112 is an abundant number, since it is smaller than the sum of its proper divisors (5681988144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001020112 is a wasteful number, since it uses less digits than its factorization.
2001020112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 125 (or 91 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 2001020112 is about 44732.7632949274. The cubic root of 2001020112 is about 1260.1352235825.
Adding to 2001020112 its reverse (2110201002), we get a palindrome (4111221114).
The spelling of 2001020112 in words is "two billion, one million, twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •