Base | Representation |
---|---|
bin | 11011110010001111100111… |
… | …101110010000010110111100 |
3 | 121000200012120021001101122012 |
4 | 123302033213232100112330 |
5 | 112004111101030413040 |
6 | 1111521523411110352 |
7 | 34511441654304212 |
oct | 3362174756202674 |
9 | 530605507041565 |
10 | 122200002201020 |
11 | 35a33803549917 |
12 | 118572195a23b8 |
13 | 53255455a0c93 |
14 | 2226724014cb2 |
15 | e1da80d8e865 |
hex | 6f23e7b905bc |
122200002201020 has 24 divisors (see below), whose sum is σ = 256680258382800. Its totient is φ = 48868523973632.
The previous prime is 122200002200989. The next prime is 122200002201061. The reversal of 122200002201020 is 20102200002221.
It is a junction number, because it is equal to n+sod(n) for n = 122200002200986 and 122200002201004.
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, 717219365 + ... + 717389724.
It is an arithmetic number, because the mean of its divisors is an integer number (10695010765950).
Almost surely, 2122200002201020 is an apocalyptic number.
122200002201020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122200002201020 is an abundant number, since it is smaller than the sum of its proper divisors (134480256181780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122200002201020 is a wasteful number, since it uses less digits than its factorization.
122200002201020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1434613357 (or 1434613355 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 122200002201020 its reverse (20102200002221), we get a palindrome (142302202203241).
The spelling of 122200002201020 in words is "one hundred twenty-two trillion, two hundred billion, two million, two hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •