Base | Representation |
---|---|
bin | 100000001011001010100… |
… | …010011010111100000011 |
3 | 21211101000011200000022112 |
4 | 200023022202122330003 |
5 | 242211122332223021 |
6 | 4411420255325535 |
7 | 315511630130051 |
oct | 40131242327403 |
9 | 7741004600275 |
10 | 2211011211011 |
11 | 782759207879 |
12 | 2b86132208ab |
13 | 130660c04a05 |
14 | 7902911d1d1 |
15 | 3c7a7ea7d5b |
hex | 202ca89af03 |
2211011211011 has 4 divisors (see below), whose sum is σ = 2211605732400. Its totient is φ = 2210416689624.
The previous prime is 2211011210971. The next prime is 2211011211049. The reversal of 2211011211011 is 1101121101122.
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-2211011211011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2211011211061) 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, 297255116 + ... + 297262553.
It is an arithmetic number, because the mean of its divisors is an integer number (552901433100).
Almost surely, 22211011211011 is an apocalyptic number.
2211011211011 is a deficient number, since it is larger than the sum of its proper divisors (594521389).
2211011211011 is an equidigital number, since it uses as much as digits as its factorization.
2211011211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 594521388.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 2211011211011 its reverse (1101121101122), we get a palindrome (3312132312133).
It can be divided in two parts, 22 and 11011211011, that multiplied together give a palindrome (242246642242).
The spelling of 2211011211011 in words is "two trillion, two hundred eleven billion, eleven million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •