Base | Representation |
---|---|
bin | 11101001000100001001… |
… | …010010001001101110101 |
3 | 21002101112121002022120001 |
4 | 131020201022101031311 |
5 | 230300104320200041 |
6 | 4131413341511301 |
7 | 264432462400312 |
oct | 35104112211565 |
9 | 7071477068501 |
10 | 2002011100021 |
11 | 70205908a019 |
12 | 284005572531 |
13 | 116a340c6b9a |
14 | 6cc7d9d7d09 |
15 | 37124834131 |
hex | 1d221291375 |
2002011100021 has 4 divisors (see below), whose sum is σ = 2003720760544. Its totient is φ = 2000301439500.
The previous prime is 2002011100007. The next prime is 2002011100043. The reversal of 2002011100021 is 1200011102002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2002011100021 - 217 = 2002010968949 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002011099980 and 2002011100007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002011100121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 854828505 + ... + 854830846.
It is an arithmetic number, because the mean of its divisors is an integer number (500930190136).
Almost surely, 22002011100021 is an apocalyptic number.
It is an amenable number.
2002011100021 is a deficient number, since it is larger than the sum of its proper divisors (1709660523).
2002011100021 is a wasteful number, since it uses less digits than its factorization.
2002011100021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1709660522.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2002011100021 its reverse (1200011102002), we get a palindrome (3202022202023).
The spelling of 2002011100021 in words is "two trillion, two billion, eleven million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •