Base | Representation |
---|---|
bin | 10001110010000110000… |
… | …101000111111011101101 |
3 | 11022211020200121021200200 |
4 | 101302012011013323231 |
5 | 130010144132432341 |
6 | 2333215513544113 |
7 | 154200541222230 |
oct | 21620605077355 |
9 | 4284220537620 |
10 | 1222020202221 |
11 | 43128a600a25 |
12 | 178a04115039 |
13 | 8b30b691170 |
14 | 43208c47417 |
15 | 21bc2ea9db6 |
hex | 11c86147eed |
1222020202221 has 144 divisors (see below), whose sum is σ = 2237062464000. Its totient is φ = 625960037376.
The previous prime is 1222020202187. The next prime is 1222020202229.
1222020202221 is a `hidden beast` number, since 1 + 2 + 220 + 20 + 202 + 221 = 666.
1222020202221 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 1222020202221 - 230 = 1220946460397 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1222020202194 and 1222020202203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222020202229) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 1164937705 + ... + 1164938753.
It is an arithmetic number, because the mean of its divisors is an integer number (15535156000).
Almost surely, 21222020202221 is an apocalyptic number.
It is an amenable number.
1222020202221 is a deficient number, since it is larger than the sum of its proper divisors (1015042261779).
1222020202221 is a wasteful number, since it uses less digits than its factorization.
1222020202221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2188 (or 2148 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
It can be divided in two parts, 1222020 and 202221, that added together give a palindrome (1424241).
The spelling of 1222020202221 in words is "one trillion, two hundred twenty-two billion, twenty million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •