Base | Representation |
---|---|
bin | 11101001000100000100… |
… | …000011001000010100101 |
3 | 21002101111211102120120110 |
4 | 131020200200121002211 |
5 | 230300044012401041 |
6 | 4131412310323233 |
7 | 264432300155424 |
oct | 35104040310245 |
9 | 7071454376513 |
10 | 2002000122021 |
11 | 702052971099 |
12 | 284001959519 |
13 | 116a31a52123 |
14 | 6cc7c37b2bb |
15 | 371238b6516 |
hex | 1d2208190a5 |
2002000122021 has 4 divisors (see below), whose sum is σ = 2669333496032. Its totient is φ = 1334666748012.
The previous prime is 2002000122013. The next prime is 2002000122053. The reversal of 2002000122021 is 1202210002002.
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 not a de Polignac number, because 2002000122021 - 23 = 2002000122013 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002000121988 and 2002000122006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002000622021) 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, 333666687001 + ... + 333666687006.
It is an arithmetic number, because the mean of its divisors is an integer number (667333374008).
Almost surely, 22002000122021 is an apocalyptic number.
It is an amenable number.
2002000122021 is a deficient number, since it is larger than the sum of its proper divisors (667333374011).
2002000122021 is an equidigital number, since it uses as much as digits as its factorization.
2002000122021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 667333374010.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2002000122021 its reverse (1202210002002), we get a palindrome (3204210124023).
The spelling of 2002000122021 in words is "two trillion, two billion, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •