Base | Representation |
---|---|
bin | 11101001000101101100… |
… | …111111101111110000101 |
3 | 21002102002011120022101220 |
4 | 131020231213331332011 |
5 | 230301021333241401 |
6 | 4131450211510553 |
7 | 264440611665444 |
oct | 35105547757605 |
9 | 7072064508356 |
10 | 2002220212101 |
11 | 70215612601a |
12 | 2840635b8459 |
13 | 116a68521845 |
14 | 6cc9d6acd5b |
15 | 37137d8d336 |
hex | 1d22d9fdf85 |
2002220212101 has 4 divisors (see below), whose sum is σ = 2669626949472. Its totient is φ = 1334813474732.
The previous prime is 2002220212081. The next prime is 2002220212183. The reversal of 2002220212101 is 1012120222002.
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 2002220212101 - 26 = 2002220212037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002220219101) 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, 333703368681 + ... + 333703368686.
It is an arithmetic number, because the mean of its divisors is an integer number (667406737368).
Almost surely, 22002220212101 is an apocalyptic number.
It is an amenable number.
2002220212101 is a deficient number, since it is larger than the sum of its proper divisors (667406737371).
2002220212101 is an equidigital number, since it uses as much as digits as its factorization.
2002220212101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667406737370.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2002220212101 its reverse (1012120222002), we get a palindrome (3014340434103).
Subtracting from 2002220212101 its reverse (1012120222002), we obtain a palindrome (990099990099).
The spelling of 2002220212101 in words is "two trillion, two billion, two hundred twenty million, two hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •