Base | Representation |
---|---|
bin | 111011101010101… |
… | …1001111110010000 |
3 | 12011112022020001000 |
4 | 1313111121332100 |
5 | 13100014200422 |
6 | 530355542000 |
7 | 100420366365 |
oct | 16725317620 |
9 | 5145266030 |
10 | 2002100112 |
11 | 9381514a1 |
12 | 47a5ba900 |
13 | 25ba3122c |
14 | 14dc8446c |
15 | bab79cac |
hex | 77559f90 |
2002100112 has 80 divisors (see below), whose sum is σ = 5800610880. Its totient is φ = 661114368.
The previous prime is 2002100099. The next prime is 2002100201. The reversal of 2002100112 is 2110012002.
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 = 2002100094 and 2002100103.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24568 + ... + 67880.
It is an arithmetic number, because the mean of its divisors is an integer number (72507636).
Almost surely, 22002100112 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 2002100112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2900305440).
2002100112 is an abundant number, since it is smaller than the sum of its proper divisors (3798510768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002100112 is a wasteful number, since it uses less digits than its factorization.
2002100112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43437 (or 43425 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 2002100112 is about 44744.8333553719. The cubic root of 2002100112 is about 1260.3618915141.
Adding to 2002100112 its reverse (2110012002), we get a palindrome (4112112114).
The spelling of 2002100112 in words is "two billion, two million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •