Base | Representation |
---|---|
bin | 110010000011000100011111… |
… | …010000010001001010101110 |
3 | 1001212100121220120021010102220 |
4 | 302003010133100101022232 |
5 | 212322314021121423042 |
6 | 2100050353334500210 |
7 | 64235442564522312 |
oct | 6203043720211256 |
9 | 1055317816233386 |
10 | 220113303311022 |
11 | 64153589416a00 |
12 | 2082b523b04666 |
13 | 95a8798240c04 |
14 | 3c4d77da63b42 |
15 | 1a6a9bb0268ec |
hex | c8311f4112ae |
220113303311022 has 48 divisors (see below), whose sum is σ = 483938685019776. Its totient is φ = 66693661966800.
The previous prime is 220113303311017. The next prime is 220113303311047.
220113303311022 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 220113303310983 and 220113303311001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10075018 + ... + 23275149.
It is an arithmetic number, because the mean of its divisors is an integer number (10082055937912).
Almost surely, 2220113303311022 is an apocalyptic number.
220113303311022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
220113303311022 is an abundant number, since it is smaller than the sum of its proper divisors (263825381708754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220113303311022 is a wasteful number, since it uses less digits than its factorization.
220113303311022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33359285 (or 33359274 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
It can be divided in two parts, 22011330 and 3311022, that added together give a palindrome (25322352).
The spelling of 220113303311022 in words is "two hundred twenty trillion, one hundred thirteen billion, three hundred three million, three hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •