Base | Representation |
---|---|
bin | 111000110111001100… |
… | …0100000010111110101 |
3 | 102200012010101121222110 |
4 | 1301232120200113311 |
5 | 4000040404031401 |
6 | 132032542321233 |
7 | 11552011251324 |
oct | 1615630402765 |
9 | 380163347873 |
10 | 122111002101 |
11 | 47872528260 |
12 | 1b7ba889219 |
13 | b690657c3a |
14 | 5ca58580bb |
15 | 329a4929d6 |
hex | 1c6e6205f5 |
122111002101 has 16 divisors (see below), whose sum is σ = 177700723200. Its totient is φ = 73971367920.
The previous prime is 122111002067. The next prime is 122111002141. The reversal of 122111002101 is 101200111221.
It is not a de Polignac number, because 122111002101 - 213 = 122110993909 is a prime.
It is a super-2 number, since 2×1221110021012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122111002141) 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, 812185 + ... + 950718.
It is an arithmetic number, because the mean of its divisors is an integer number (11106295200).
Almost surely, 2122111002101 is an apocalyptic number.
122111002101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122111002101 is a deficient number, since it is larger than the sum of its proper divisors (55589721099).
122111002101 is a wasteful number, since it uses less digits than its factorization.
122111002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1765016.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 122111002101 its reverse (101200111221), we get a palindrome (223311113322).
The spelling of 122111002101 in words is "one hundred twenty-two billion, one hundred eleven million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •