Base | Representation |
---|---|
bin | 11011110010100010010101… |
… | …101010000101000101001100 |
3 | 121000202010102221000002022221 |
4 | 123302202111222011011030 |
5 | 112004423231123223040 |
6 | 1111535050001145124 |
7 | 34513053006464440 |
oct | 3362422552050514 |
9 | 530663387002287 |
10 | 122220100211020 |
11 | 35a41287330239 |
12 | 1185b0a832b1a4 |
13 | 53273c93736a6 |
14 | 22276ad330820 |
15 | e1e35a51a74a |
hex | 6f2895a8514c |
122220100211020 has 96 divisors (see below), whose sum is σ = 293703200179200. Its totient is φ = 41850477391104.
The previous prime is 122220100210981. The next prime is 122220100211107. The reversal of 122220100211020 is 20112001022221.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 122220100210985 and 122220100211003.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1605522679 + ... + 1605598801.
It is an arithmetic number, because the mean of its divisors is an integer number (3059408335200).
Almost surely, 2122220100211020 is an apocalyptic number.
122220100211020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122220100211020 is an abundant number, since it is smaller than the sum of its proper divisors (171483099968180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122220100211020 is a wasteful number, since it uses less digits than its factorization.
122220100211020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90647 (or 90645 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 122220100211020 its reverse (20112001022221), we get a palindrome (142332101233241).
The spelling of 122220100211020 in words is "one hundred twenty-two trillion, two hundred twenty billion, one hundred million, two hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •