Base | Representation |
---|---|
bin | 111000110111011101… |
… | …0110101001001100101 |
3 | 102200012202022202220201 |
4 | 1301232322311021211 |
5 | 4000100210000401 |
6 | 132033503230501 |
7 | 11552150605501 |
oct | 1615672651145 |
9 | 380182282821 |
10 | 122120000101 |
11 | 47877613620 |
12 | 1b8018a8431 |
13 | b6924886b8 |
14 | 5ca6b1b301 |
15 | 329b16db01 |
hex | 1c6eeb5265 |
122120000101 has 4 divisors (see below), whose sum is σ = 133221818304. Its totient is φ = 111018181900.
The previous prime is 122120000099. The next prime is 122120000141. The reversal of 122120000101 is 101000021221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 122120000101 - 21 = 122120000099 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122120000141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5550909085 + ... + 5550909106.
It is an arithmetic number, because the mean of its divisors is an integer number (33305454576).
Almost surely, 2122120000101 is an apocalyptic number.
122120000101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
122120000101 is a deficient number, since it is larger than the sum of its proper divisors (11101818203).
122120000101 is a wasteful number, since it uses less digits than its factorization.
122120000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11101818202.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 122120000101 its reverse (101000021221), we get a palindrome (223120021322).
The spelling of 122120000101 in words is "one hundred twenty-two billion, one hundred twenty million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •