Base | Representation |
---|---|
bin | 111000011001000101… |
… | …1110001011011000111 |
3 | 102120120201221210020111 |
4 | 1300302023301123013 |
5 | 3441003330443421 |
6 | 131344423213451 |
7 | 11514665531434 |
oct | 1606213613307 |
9 | 376521853214 |
10 | 121101031111 |
11 | 473a4414095 |
12 | 1b5785a7287 |
13 | b55c339478 |
14 | 5c0b672b8b |
15 | 323b991ee1 |
hex | 1c322f16c7 |
121101031111 has 2 divisors, whose sum is σ = 121101031112. Its totient is φ = 121101031110.
The previous prime is 121101031109. The next prime is 121101031123. The reversal of 121101031111 is 111130101121.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 121101031111 - 21 = 121101031109 is a prime.
It is a super-2 number, since 2×1211010311112 (a number of 23 digits) contains 22 as substring.
Together with 121101031109, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 121101031091 and 121101031100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121101031141) 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 as a sum of consecutive naturals, namely, 60550515555 + 60550515556.
It is an arithmetic number, because the mean of its divisors is an integer number (60550515556).
Almost surely, 2121101031111 is an apocalyptic number.
121101031111 is a deficient number, since it is larger than the sum of its proper divisors (1).
121101031111 is an equidigital number, since it uses as much as digits as its factorization.
121101031111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 121101031111 its reverse (111130101121), we get a palindrome (232231132232).
The spelling of 121101031111 in words is "one hundred twenty-one billion, one hundred one million, thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •