Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …011111011100111110001 |
3 | 21002101210111101010202001 |
4 | 131020213003323213301 |
5 | 230300310141231001 |
6 | 4131431235454001 |
7 | 264435104034652 |
oct | 35104703734761 |
9 | 7071714333661 |
10 | 2002110102001 |
11 | 7020a9a59739 |
12 | 284032757301 |
13 | 116a4b77b339 |
14 | 6cc8cc09529 |
15 | 3712d38d001 |
hex | 1d2270fb9f1 |
2002110102001 has 4 divisors (see below), whose sum is σ = 2030308835904. Its totient is φ = 1973911368100.
The previous prime is 2002110101881. The next prime is 2002110102029. The reversal of 2002110102001 is 1002010112002.
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 2002110102001 - 215 = 2002110069233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002110102701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14099366845 + ... + 14099366986.
It is an arithmetic number, because the mean of its divisors is an integer number (507577208976).
Almost surely, 22002110102001 is an apocalyptic number.
It is an amenable number.
2002110102001 is a deficient number, since it is larger than the sum of its proper divisors (28198733903).
2002110102001 is an equidigital number, since it uses as much as digits as its factorization.
2002110102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28198733902.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2002110102001 its reverse (1002010112002), we get a palindrome (3004120214003).
The spelling of 2002110102001 in words is "two trillion, two billion, one hundred ten million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •