Base | Representation |
---|---|
bin | 110010000100100111110111… |
… | …100010010000011010001111 |
3 | 1001212201211100012211111010012 |
4 | 302010213313202100122033 |
5 | 212331041040321322041 |
6 | 2100211402041303435 |
7 | 64246241112114101 |
oct | 6204476742203217 |
9 | 1055654305744105 |
10 | 220220011120271 |
11 | 64194867176408 |
12 | 20848144194b7b |
13 | 95b5872661146 |
14 | 3c549c3901571 |
15 | 1a6d6640b03eb |
hex | c849f789068f |
220220011120271 has 2 divisors, whose sum is σ = 220220011120272. Its totient is φ = 220220011120270.
The previous prime is 220220011120231. The next prime is 220220011120283. The reversal of 220220011120271 is 172021110022022.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220220011120271 is a prime.
It is a super-2 number, since 2×2202200111202712 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220220011120231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110110005560135 + 110110005560136.
It is an arithmetic number, because the mean of its divisors is an integer number (110110005560136).
Almost surely, 2220220011120271 is an apocalyptic number.
220220011120271 is a deficient number, since it is larger than the sum of its proper divisors (1).
220220011120271 is an equidigital number, since it uses as much as digits as its factorization.
220220011120271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 23.
Adding to 220220011120271 its reverse (172021110022022), we get a palindrome (392241121142293).
The spelling of 220220011120271 in words is "two hundred twenty trillion, two hundred twenty billion, eleven million, one hundred twenty thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •