Base | Representation |
---|---|
bin | 11101001000101101101… |
… | …111001011001001101100 |
3 | 21002102002022010021121211 |
4 | 131020231233023021230 |
5 | 230301022324213400 |
6 | 4131450320204204 |
7 | 264440634023644 |
oct | 35105557131154 |
9 | 7072068107554 |
10 | 2002222101100 |
11 | 7021571a6281 |
12 | 284064169664 |
13 | 116a68a335b0 |
14 | 6cc9da41524 |
15 | 37138112dba |
hex | 1d22dbcb26c |
2002222101100 has 72 divisors (see below), whose sum is σ = 4680720411248. Its totient is φ = 739016352000.
The previous prime is 2002222101091. The next prime is 2002222101127. The reversal of 2002222101100 is 11012222002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3360775 + ... + 3911425.
Almost surely, 22002222101100 is an apocalyptic number.
2002222101100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2002222101100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2340360205624).
2002222101100 is an abundant number, since it is smaller than the sum of its proper divisors (2678498310148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002222101100 is a wasteful number, since it uses less digits than its factorization.
2002222101100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 553475 (or 553468 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2002222101100 its reverse (11012222002), we get a palindrome (2013234323102).
The spelling of 2002222101100 in words is "two trillion, two billion, two hundred twenty-two million, one hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •