Base | Representation |
---|---|
bin | 111000011100101100… |
… | …1010001100011011101 |
3 | 102120220011121012120212 |
4 | 1300321121101203131 |
5 | 3441230313323401 |
6 | 131404424222205 |
7 | 11520665043662 |
oct | 1607131214335 |
9 | 376804535525 |
10 | 121222011101 |
11 | 47456735154 |
12 | 1b5b100a965 |
13 | b57b417469 |
14 | 5c1d765a69 |
15 | 32473dcdbb |
hex | 1c396518dd |
121222011101 has 4 divisors (see below), whose sum is σ = 121252572672. Its totient is φ = 121191449532.
The previous prime is 121222011067. The next prime is 121222011103. The reversal of 121222011101 is 101110222121.
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 121222011101 - 218 = 121221748957 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 (121222011103) 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 3 ways as a sum of consecutive naturals, for example, 15274835 + ... + 15282768.
It is an arithmetic number, because the mean of its divisors is an integer number (30313143168).
Almost surely, 2121222011101 is an apocalyptic number.
It is an amenable number.
121222011101 is a deficient number, since it is larger than the sum of its proper divisors (30561571).
121222011101 is an equidigital number, since it uses as much as digits as its factorization.
121222011101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30561570.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121222011101 its reverse (101110222121), we get a palindrome (222332233222).
The spelling of 121222011101 in words is "one hundred twenty-one billion, two hundred twenty-two million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •