Base | Representation |
---|---|
bin | 111000011100101100… |
… | …1010001100011100101 |
3 | 102120220011121012121011 |
4 | 1300321121101203211 |
5 | 3441230313323414 |
6 | 131404424222221 |
7 | 11520665044003 |
oct | 1607131214345 |
9 | 376804535534 |
10 | 121222011109 |
11 | 47456735161 |
12 | 1b5b100a971 |
13 | b57b417474 |
14 | 5c1d765a73 |
15 | 32473dcdc4 |
hex | 1c396518e5 |
121222011109 has 4 divisors (see below), whose sum is σ = 121314760704. Its totient is φ = 121129261516.
The previous prime is 121222011103. The next prime is 121222011137. The reversal of 121222011109 is 901110222121.
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, and also an emirpimes, since its reverse is a distinct semiprime: 901110222121 = 1009 ⋅893072569.
It is a cyclic number.
It is not a de Polignac number, because 121222011109 - 225 = 121188456677 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121222011109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121222011103) 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, 46372837 + ... + 46375450.
It is an arithmetic number, because the mean of its divisors is an integer number (30328690176).
Almost surely, 2121222011109 is an apocalyptic number.
It is an amenable number.
121222011109 is a deficient number, since it is larger than the sum of its proper divisors (92749595).
121222011109 is an equidigital number, since it uses as much as digits as its factorization.
121222011109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92749594.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 121222011109 in words is "one hundred twenty-one billion, two hundred twenty-two million, eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •