Base | Representation |
---|---|
bin | 10001110000010100010… |
… | …110010111101100100011 |
3 | 11022122022201012200210102 |
4 | 101300110112113230203 |
5 | 124442242200324421 |
6 | 2332302313053015 |
7 | 154102341623126 |
oct | 21602426275443 |
9 | 4278281180712 |
10 | 1220112120611 |
11 | 4304a0535a7a |
12 | 1785710b716b |
13 | 8b09628aca7 |
14 | 430a76783bd |
15 | 21b1070260b |
hex | 11c14597b23 |
1220112120611 has 2 divisors, whose sum is σ = 1220112120612. Its totient is φ = 1220112120610.
The previous prime is 1220112120607. The next prime is 1220112120613. The reversal of 1220112120611 is 1160212110221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1220112120611 - 22 = 1220112120607 is a prime.
It is a super-2 number, since 2×12201121206112 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 1220112120613, 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 (1220112120613) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 610056060305 + 610056060306.
It is an arithmetic number, because the mean of its divisors is an integer number (610056060306).
Almost surely, 21220112120611 is an apocalyptic number.
1220112120611 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220112120611 is an equidigital number, since it uses as much as digits as its factorization.
1220112120611 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 1220112120611 its reverse (1160212110221), we get a palindrome (2380324230832).
The spelling of 1220112120611 in words is "one trillion, two hundred twenty billion, one hundred twelve million, one hundred twenty thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •