Base | Representation |
---|---|
bin | 10001110000001101101… |
… | …111010010011100111100 |
3 | 11022122000222111222002020 |
4 | 101300031233102130330 |
5 | 124442030302242340 |
6 | 2332243312000140 |
7 | 154066524126060 |
oct | 21601557223474 |
9 | 4278028458066 |
10 | 1220001212220 |
11 | 43044397394a |
12 | 17853bb30050 |
13 | 8b0792c831b |
14 | 43096a47aa0 |
15 | 21b05ae59d0 |
hex | 11c0dbd273c |
1220001212220 has 96 divisors (see below), whose sum is σ = 3911220880896. Its totient is φ = 278341920000.
The previous prime is 1220001212191. The next prime is 1220001212233. The reversal of 1220001212220 is 222121000221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1220001212220.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2457406 + ... + 2911845.
It is an arithmetic number, because the mean of its divisors is an integer number (40741884176).
Almost surely, 21220001212220 is an apocalyptic number.
1220001212220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1220001212220 is an abundant number, since it is smaller than the sum of its proper divisors (2691219668676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220001212220 is a wasteful number, since it uses less digits than its factorization.
1220001212220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5369811 (or 5369809 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1220001212220 its reverse (222121000221), we get a palindrome (1442122212441).
The spelling of 1220001212220 in words is "one trillion, two hundred twenty billion, one million, two hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •