Base | Representation |
---|---|
bin | 11101001000101101100… |
… | …111001101010111010011 |
3 | 21002102002011012012022012 |
4 | 131020231213031113103 |
5 | 230301021310404021 |
6 | 4131450203333135 |
7 | 264440610206141 |
oct | 35105547152723 |
9 | 7072064165265 |
10 | 2002220013011 |
11 | 702155aaa489 |
12 | 2840635211ab |
13 | 116a6848203a |
14 | 6cc9d65a591 |
15 | 37137d4e35b |
hex | 1d22d9cd5d3 |
2002220013011 has 4 divisors (see below), whose sum is σ = 2007502915800. Its totient is φ = 1996937110224.
The previous prime is 2002220012959. The next prime is 2002220013043. The reversal of 2002220013011 is 1103100222002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002220013011 is a prime.
It is a super-2 number, since 2×20022200130112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2002220013061) 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, 2641450826 + ... + 2641451583.
It is an arithmetic number, because the mean of its divisors is an integer number (501875728950).
Almost surely, 22002220013011 is an apocalyptic number.
2002220013011 is a deficient number, since it is larger than the sum of its proper divisors (5282902789).
2002220013011 is an equidigital number, since it uses as much as digits as its factorization.
2002220013011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5282902788.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 2002220013011 its reverse (1103100222002), we get a palindrome (3105320235013).
The spelling of 2002220013011 in words is "two trillion, two billion, two hundred twenty million, thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •