Base | Representation |
---|---|
bin | 110010000100010111010010… |
… | …100101000001111010000001 |
3 | 1001212200010101201011220212010 |
4 | 302010113102211001322001 |
5 | 212330243112033033441 |
6 | 2100155255503523133 |
7 | 64245041033346303 |
oct | 6204272245017201 |
9 | 1055603351156763 |
10 | 220202211221121 |
11 | 64188262635758 |
12 | 208447b6bb94a9 |
13 | 95b3c96a21a3c |
14 | 3c53bb58c1973 |
15 | 1a6ce71581116 |
hex | c845d2941e81 |
220202211221121 has 24 divisors (see below), whose sum is σ = 306925529049216. Its totient is φ = 140417785631200.
The previous prime is 220202211221119. The next prime is 220202211221197. The reversal of 220202211221121 is 121122112202022.
It is not a de Polignac number, because 220202211221121 - 21 = 220202211221119 is a prime.
It is not an unprimeable number, because it can be changed into a prime (220202211225121) 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 in 23 ways as a sum of consecutive naturals, for example, 262310371 + ... + 263148503.
It is an arithmetic number, because the mean of its divisors is an integer number (12788563710384).
Almost surely, 2220202211221121 is an apocalyptic number.
It is an amenable number.
220202211221121 is a deficient number, since it is larger than the sum of its proper divisors (86723317828095).
220202211221121 is a wasteful number, since it uses less digits than its factorization.
220202211221121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003733 (or 1003710 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 220202211221121 its reverse (121122112202022), we get a palindrome (341324323423143).
The spelling of 220202211221121 in words is "two hundred twenty trillion, two hundred two billion, two hundred eleven million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •