Base | Representation |
---|---|
bin | 110010000100010111001100… |
… | …001000101000010110101100 |
3 | 1001212200010010011202110120112 |
4 | 302010113030020220112230 |
5 | 212330242401344110012 |
6 | 2100155241042435152 |
7 | 64245035251424540 |
oct | 6204271410502654 |
9 | 1055603104673515 |
10 | 220202103113132 |
11 | 64188207606608 |
12 | 20844786962ab8 |
13 | 95b3c7a4cc90a |
14 | 3c53ba53bda20 |
15 | 1a6ce66d29122 |
hex | c845cc2285ac |
220202103113132 has 48 divisors (see below), whose sum is σ = 445267403642880. Its totient is φ = 93332636897472.
The previous prime is 220202103113101. The next prime is 220202103113183. The reversal of 220202103113132 is 231311301202022.
It is a junction number, because it is equal to n+sod(n) for n = 220202103113098 and 220202103113107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48248132 + ... + 52614507.
It is an arithmetic number, because the mean of its divisors is an integer number (9276404242560).
Almost surely, 2220202103113132 is an apocalyptic number.
It is an amenable number.
220202103113132 is an abundant number, since it is smaller than the sum of its proper divisors (225065300529748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220202103113132 is a wasteful number, since it uses less digits than its factorization.
220202103113132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100863510 (or 100863508 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 220202103113132 its reverse (231311301202022), we get a palindrome (451513404315154).
The spelling of 220202103113132 in words is "two hundred twenty trillion, two hundred two billion, one hundred three million, one hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •