Base | Representation |
---|---|
bin | 100000010100011110100… |
… | …101010110100000001011 |
3 | 21212022211002102002100111 |
4 | 200110132211112200023 |
5 | 242342112331400021 |
6 | 4420152442015151 |
7 | 316314504464662 |
oct | 40243645264013 |
9 | 7768732362314 |
10 | 2221011200011 |
11 | 786a1aa1459a |
12 | 2ba5441a74b7 |
13 | 1315958ba176 |
14 | 796d727bdd9 |
15 | 3cb90d628e1 |
hex | 2051e95680b |
2221011200011 has 4 divisors (see below), whose sum is σ = 2292656722624. Its totient is φ = 2149365677400.
The previous prime is 2221011200003. The next prime is 2221011200041. The reversal of 2221011200011 is 1100021101222.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2221011200011 - 23 = 2221011200003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2221011199964 and 2221011200000.
It is not an unprimeable number, because it can be changed into a prime (2221011200041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35822761260 + ... + 35822761321.
It is an arithmetic number, because the mean of its divisors is an integer number (573164180656).
Almost surely, 22221011200011 is an apocalyptic number.
2221011200011 is a deficient number, since it is larger than the sum of its proper divisors (71645522613).
2221011200011 is an equidigital number, since it uses as much as digits as its factorization.
2221011200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71645522612.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2221011200011 its reverse (1100021101222), we get a palindrome (3321032301233).
The spelling of 2221011200011 in words is "two trillion, two hundred twenty-one billion, eleven million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •