Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …100110001010101010000 |
3 | 21002101210111210022112011 |
4 | 131020213010301111100 |
5 | 230300310220301000 |
6 | 4131431244312304 |
7 | 264435105642235 |
oct | 35104704612520 |
9 | 7071714708464 |
10 | 2002110322000 |
11 | 7020aa099a58 |
12 | 284032842694 |
13 | 116a4b827509 |
14 | 6cc8cc6578c |
15 | 3712d3d32ba |
hex | 1d227131550 |
2002110322000 has 40 divisors (see below), whose sum is σ = 4841102763432. Its totient is φ = 800844128000.
The previous prime is 2002110321997. The next prime is 2002110322013. The reversal of 2002110322000 is 2230112002.
It can be written as a sum of positive squares in 4 ways, for example, as 201543532096 + 1800566789904 = 448936^2 + 1341852^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 500525581 + ... + 500529580.
Almost surely, 22002110322000 is an apocalyptic number.
2002110322000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002110322000 is an abundant number, since it is smaller than the sum of its proper divisors (2838992441432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002110322000 is a wasteful number, since it uses less digits than its factorization.
2002110322000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1001055184 (or 1001055168 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 2002110322000 its reverse (2230112002), we get a palindrome (2004340434002).
The spelling of 2002110322000 in words is "two trillion, two billion, one hundred ten million, three hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •