Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …011100101011110100100 |
3 | 21002101210111012112022202 |
4 | 131020213003211132210 |
5 | 230300310130330200 |
6 | 4131431233514032 |
7 | 264435103206350 |
oct | 35104703453644 |
9 | 7071714175282 |
10 | 2002110011300 |
11 | 7020a99a7583 |
12 | 284032712918 |
13 | 116a4b748c79 |
14 | 6cc8cbc4460 |
15 | 3712d3711d5 |
hex | 1d2270e57a4 |
2002110011300 has 144 divisors (see below), whose sum is σ = 5030656350720. Its totient is φ = 677401920000.
The previous prime is 2002110011287. The next prime is 2002110011311. The reversal of 2002110011300 is 31100112002.
It is a super-2 number, since 2×20021100113002 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 122813150 + ... + 122829450.
Almost surely, 22002110011300 is an apocalyptic number.
2002110011300 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 2002110011300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2515328175360).
2002110011300 is an abundant number, since it is smaller than the sum of its proper divisors (3028546339420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002110011300 is a wasteful number, since it uses less digits than its factorization.
2002110011300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18622 (or 18615 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 2002110011300 its reverse (31100112002), we get a palindrome (2033210123302).
The spelling of 2002110011300 in words is "two trillion, two billion, one hundred ten million, eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •