Base | Representation |
---|---|
bin | 11011110001000101000111… |
… | …001110110110000110100000 |
3 | 121000101120001210011201021212 |
4 | 123301011013032312012200 |
5 | 112001303230022413440 |
6 | 1111421053102405252 |
7 | 34502610306443045 |
oct | 3361050716660640 |
9 | 530346053151255 |
10 | 122120000201120 |
11 | 35a0288a4a7229 |
12 | 11843810b90828 |
13 | 531ab35c18abc |
14 | 22228d4cb91cc |
15 | e1b94c628465 |
hex | 6f11473b61a0 |
122120000201120 has 48 divisors (see below), whose sum is σ = 288526076166888. Its totient is φ = 48845024302080.
The previous prime is 122120000201117. The next prime is 122120000201191. The reversal of 122120000201120 is 21102000021221.
It can be written as a sum of positive squares in 4 ways, for example, as 64185798652816 + 57934201548304 = 8011604^2 + 7611452^2 .
It is a junction number, because it is equal to n+sod(n) for n = 122120000201095 and 122120000201104.
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, 20612699 + ... + 25867418.
Almost surely, 2122120000201120 is an apocalyptic number.
122120000201120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122120000201120 is an abundant number, since it is smaller than the sum of its proper divisors (166406075965768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122120000201120 is a wasteful number, since it uses less digits than its factorization.
122120000201120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46496553 (or 46496545 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 122120000201120 its reverse (21102000021221), we get a palindrome (143222000222341).
The spelling of 122120000201120 in words is "one hundred twenty-two trillion, one hundred twenty billion, two hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •