Base | Representation |
---|---|
bin | 11101001000100111001… |
… | …000000111111011101000 |
3 | 21002101210120102222021201 |
4 | 131020213020013323220 |
5 | 230300310431413000 |
6 | 4131431315213544 |
7 | 264435116263021 |
oct | 35104710077350 |
9 | 7071716388251 |
10 | 2002111201000 |
11 | 7020aa63a3a9 |
12 | 284032ba72b4 |
13 | 116a4ba74631 |
14 | 6cc8d013c48 |
15 | 3712d50896a |
hex | 1d227207ee8 |
2002111201000 has 32 divisors (see below), whose sum is σ = 4684940212680. Its totient is φ = 800844480000.
The previous prime is 2002111200997. The next prime is 2002111201063. The reversal of 2002111201000 is 1021112002.
It can be written as a sum of positive squares in 4 ways, for example, as 179821794916 + 1822289406084 = 424054^2 + 1349922^2 .
It is a super-2 number, since 2×20021112010002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1001054601 + ... + 1001056600.
Almost surely, 22002111201000 is an apocalyptic number.
2002111201000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002111201000 is an abundant number, since it is smaller than the sum of its proper divisors (2682829011680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002111201000 is a wasteful number, since it uses less digits than its factorization.
2002111201000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2002111222 (or 2002111208 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2002111201000 its reverse (1021112002), we get a palindrome (2003132313002).
The spelling of 2002111201000 in words is "two trillion, two billion, one hundred eleven million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •