Base | Representation |
---|---|
bin | 11011110010011001000001… |
… | …100110011000001110011000 |
3 | 121000201011121222212202100012 |
4 | 123302121001212120032120 |
5 | 112004242241101120440 |
6 | 1111530313410301052 |
7 | 34512250130326100 |
oct | 3362310146301630 |
9 | 530634558782305 |
10 | 122210100020120 |
11 | 35a380154a5862 |
12 | 11859177287788 |
13 | 532649461a378 |
14 | 222700115c200 |
15 | e1de72620e65 |
hex | 6f2641998398 |
122210100020120 has 96 divisors (see below), whose sum is σ = 321055326356400. Its totient is φ = 41744841207552.
The previous prime is 122210100020119. The next prime is 122210100020159. The reversal of 122210100020120 is 21020001012221.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 122210100020095 and 122210100020104.
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, 115368842 + ... + 116423321.
Almost surely, 2122210100020120 is an apocalyptic number.
122210100020120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122210100020120 is an abundant number, since it is smaller than the sum of its proper divisors (198845226336280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122210100020120 is a wasteful number, since it uses less digits than its factorization.
122210100020120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231792457 (or 231792446 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 122210100020120 its reverse (21020001012221), we get a palindrome (143230101032341).
The spelling of 122210100020120 in words is "one hundred twenty-two trillion, two hundred ten billion, one hundred million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •