Base | Representation |
---|---|
bin | 10001110000011010110… |
… | …010010010011001001100 |
3 | 11022122121020101201201021 |
4 | 101300122302102121030 |
5 | 124443002321232340 |
6 | 2332321131323524 |
7 | 154105122510250 |
oct | 21603262223114 |
9 | 4278536351637 |
10 | 1220220102220 |
11 | 430546489179 |
12 | 1785a12b05a4 |
13 | 8b0b2767732 |
14 | 430b7b46260 |
15 | 21b19e31e4a |
hex | 11c1ac9264c |
1220220102220 has 48 divisors (see below), whose sum is σ = 2928654828288. Its totient is φ = 418343094720.
The previous prime is 1220220102209. The next prime is 1220220102247. The reversal of 1220220102220 is 222010220221.
It is a junction number, because it is equal to n+sod(n) for n = 1220220102194 and 1220220102203.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 3290835 + ... + 3642805.
It is an arithmetic number, because the mean of its divisors is an integer number (61013642256).
Almost surely, 21220220102220 is an apocalyptic number.
1220220102220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1220220102220 is an abundant number, since it is smaller than the sum of its proper divisors (1708434726068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220220102220 is a wasteful number, since it uses less digits than its factorization.
1220220102220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376750 (or 376748 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 1220220102220 its reverse (222010220221), we get a palindrome (1442230322441).
The spelling of 1220220102220 in words is "one trillion, two hundred twenty billion, two hundred twenty million, one hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •