Base | Representation |
---|---|
bin | 110010000100011000000010… |
… | …110011110110100011000010 |
3 | 1001212200012111002211010121020 |
4 | 302010120002303312203002 |
5 | 212330301241211204442 |
6 | 2100155512051410310 |
7 | 64245100060355535 |
oct | 6204300263664302 |
9 | 1055605432733536 |
10 | 220203020413122 |
11 | 6418863838467a |
12 | 208449a1bb3996 |
13 | 95b4095572786 |
14 | 3c53c51160a1c |
15 | 1a6cebc6219ec |
hex | c84602cf68c2 |
220203020413122 has 32 divisors (see below), whose sum is σ = 440691654298752. Its totient is φ = 73353409688064.
The previous prime is 220203020413121. The next prime is 220203020413141. The reversal of 220203020413122 is 221314020302022.
It is a junction number, because it is equal to n+sod(n) for n = 220203020413092 and 220203020413101.
It is not an unprimeable number, because it can be changed into a prime (220203020413121) by changing a digit.
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, 173653563 + ... + 174917025.
It is an arithmetic number, because the mean of its divisors is an integer number (13771614196836).
Almost surely, 2220203020413122 is an apocalyptic number.
220203020413122 is an abundant number, since it is smaller than the sum of its proper divisors (220488633885630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220203020413122 is a wasteful number, since it uses less digits than its factorization.
220203020413122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1282282.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 220203020413122 its reverse (221314020302022), we get a palindrome (441517040715144).
The spelling of 220203020413122 in words is "two hundred twenty trillion, two hundred three billion, twenty million, four hundred thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •