Base | Representation |
---|---|
bin | 111000011100101101… |
… | …0000010011000100111 |
3 | 102120220011222100221122 |
4 | 1300321122002120213 |
5 | 3441230341223421 |
6 | 131404432404155 |
7 | 11520666536051 |
oct | 1607132023047 |
9 | 376804870848 |
10 | 121222211111 |
11 | 47456861451 |
12 | 1b5b10a665b |
13 | b57b487501 |
14 | 5c1d7b88d1 |
15 | 324742c2ab |
hex | 1c39682627 |
121222211111 has 4 divisors (see below), whose sum is σ = 123031497912. Its totient is φ = 119412924312.
The previous prime is 121222211101. The next prime is 121222211129. The reversal of 121222211111 is 111112222121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121222211111 - 214 = 121222194727 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 121222211111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121222211101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 904643300 + ... + 904643433.
It is an arithmetic number, because the mean of its divisors is an integer number (30757874478).
Almost surely, 2121222211111 is an apocalyptic number.
121222211111 is a deficient number, since it is larger than the sum of its proper divisors (1809286801).
121222211111 is an equidigital number, since it uses as much as digits as its factorization.
121222211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1809286800.
The product of its digits is 32, while the sum is 17.
Adding to 121222211111 its reverse (111112222121), we get a palindrome (232334433232).
The spelling of 121222211111 in words is "one hundred twenty-one billion, two hundred twenty-two million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •