Base | Representation |
---|---|
bin | 100100010111001… |
… | …1100000110111111 |
3 | 10011000220012020122 |
4 | 1020232130012333 |
5 | 4444323231221 |
6 | 321023405155 |
7 | 42143650655 |
oct | 11056340677 |
9 | 3130805218 |
10 | 1220133311 |
11 | 576808241 |
12 | 2a07537bb |
13 | 165a23497 |
14 | b8090dd5 |
15 | 721b5eab |
hex | 48b9c1bf |
1220133311 has 2 divisors, whose sum is σ = 1220133312. Its totient is φ = 1220133310.
The previous prime is 1220133293. The next prime is 1220133331. The reversal of 1220133311 is 1133310221.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1220133311 is a prime.
It is a super-2 number, since 2×12201333112 = 2977450593223645442, which contains 22 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1220133311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1220133331) 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 as a sum of consecutive naturals, namely, 610066655 + 610066656.
It is an arithmetic number, because the mean of its divisors is an integer number (610066656).
Almost surely, 21220133311 is an apocalyptic number.
1220133311 is a deficient number, since it is larger than the sum of its proper divisors (1).
1220133311 is an equidigital number, since it uses as much as digits as its factorization.
1220133311 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 17.
The square root of 1220133311 is about 34930.4066824307. The cubic root of 1220133311 is about 1068.5686486130.
Adding to 1220133311 its reverse (1133310221), we get a palindrome (2353443532).
The spelling of 1220133311 in words is "one billion, two hundred twenty million, one hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •