Base | Representation |
---|---|
bin | 10000000001100101111… |
… | …001111011101001101011 |
3 | 10220021110000011220101102 |
4 | 100001211321323221223 |
5 | 121020300124010011 |
6 | 2201521042312015 |
7 | 142363201501142 |
oct | 20014571735153 |
9 | 3807400156342 |
10 | 1101221313131 |
11 | 3950307a4695 |
12 | 15951095860b |
13 | 7cac9b22774 |
14 | 3b429784759 |
15 | 1d9a2ceb73b |
hex | 10065e7ba6b |
1101221313131 has 2 divisors, whose sum is σ = 1101221313132. Its totient is φ = 1101221313130.
The previous prime is 1101221313119. The next prime is 1101221313133. The reversal of 1101221313131 is 1313131221011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101221313131 is a prime.
It is a super-2 number, since 2×11012213131312 (a number of 25 digits) contains 22 as substring.
Together with 1101221313133, 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 (1101221313133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550610656565 + 550610656566.
It is an arithmetic number, because the mean of its divisors is an integer number (550610656566).
Almost surely, 21101221313131 is an apocalyptic number.
1101221313131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101221313131 is an equidigital number, since it uses as much as digits as its factorization.
1101221313131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 1101221313131 its reverse (1313131221011), we get a palindrome (2414352534142).
The spelling of 1101221313131 in words is "one trillion, one hundred one billion, two hundred twenty-one million, three hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •