Base | Representation |
---|---|
bin | 10000000000101010010… |
… | …010011101110000100011 |
3 | 10220011212022010101110022 |
4 | 100000222102131300203 |
5 | 121011223101030311 |
6 | 2201233512424055 |
7 | 142326335066666 |
oct | 20005222356043 |
9 | 3804768111408 |
10 | 1100221111331 |
11 | 394668153231 |
12 | 1592919a802b |
13 | 7c99a844794 |
14 | 3b3729c36dd |
15 | 1d9450ca5db |
hex | 1002a49dc23 |
1100221111331 has 2 divisors, whose sum is σ = 1100221111332. Its totient is φ = 1100221111330.
The previous prime is 1100221111207. The next prime is 1100221111333. The reversal of 1100221111331 is 1331111220011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1100221111331 is a prime.
It is a super-2 number, since 2×11002211113312 (a number of 25 digits) contains 22 as substring.
Together with 1100221111333, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1100221111333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550110555665 + 550110555666.
It is an arithmetic number, because the mean of its divisors is an integer number (550110555666).
Almost surely, 21100221111331 is an apocalyptic number.
1100221111331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100221111331 is an equidigital number, since it uses as much as digits as its factorization.
1100221111331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1100221111331 its reverse (1331111220011), we get a palindrome (2431332331342).
The spelling of 1100221111331 in words is "one trillion, one hundred billion, two hundred twenty-one million, one hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •