Base | Representation |
---|---|
bin | 11101101111101010010… |
… | …01101111010100111100 |
3 | 10121201000100100111212220 |
4 | 32313311021233110330 |
5 | 113221044134021340 |
6 | 2101302024125340 |
7 | 133560420351546 |
oct | 16676511572474 |
9 | 3551010314786 |
10 | 1022020220220 |
11 | 3644888522aa |
12 | 1460a8606850 |
13 | 754b737a24c |
14 | 37674b6c696 |
15 | 1b8b9a3aed0 |
hex | edf526f53c |
1022020220220 has 24 divisors (see below), whose sum is σ = 2861656616784. Its totient is φ = 272538725376.
The previous prime is 1022020220183. The next prime is 1022020220297. The reversal of 1022020220220 is 220220202201.
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 1022020220220.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8516835109 + ... + 8516835228.
It is an arithmetic number, because the mean of its divisors is an integer number (119235692366).
Almost surely, 21022020220220 is an apocalyptic number.
1022020220220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022020220220 is an abundant number, since it is smaller than the sum of its proper divisors (1839636396564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022020220220 is a wasteful number, since it uses less digits than its factorization.
1022020220220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17033670349 (or 17033670347 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 1022020220220 its reverse (220220202201), we get a palindrome (1242240422421).
The spelling of 1022020220220 in words is "one trillion, twenty-two billion, twenty million, two hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •