Base | Representation |
---|---|
bin | 11011100010011001100000… |
… | …110000011001000101110111 |
3 | 120212211002221120100201120222 |
4 | 123202121200300121011313 |
5 | 111333241023421023111 |
6 | 1105325402032044555 |
7 | 34336663143614336 |
oct | 3342314060310567 |
9 | 525732846321528 |
10 | 121111111111031 |
11 | 35653a2a953398 |
12 | 1170018a09375b |
13 | 5276962163552 |
14 | 21c9b4808bd1d |
15 | e005a07e27db |
hex | 6e2660c19177 |
121111111111031 has 2 divisors, whose sum is σ = 121111111111032. Its totient is φ = 121111111111030.
The previous prime is 121111111111021. The next prime is 121111111111033. The reversal of 121111111111031 is 130111111111121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121111111111031 - 222 = 121111106916727 is a prime.
It is a super-2 number, since 2×1211111111110312 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 121111111111033, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121111111111033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555555555515 + 60555555555516.
It is an arithmetic number, because the mean of its divisors is an integer number (60555555555516).
Almost surely, 2121111111111031 is an apocalyptic number.
121111111111031 is a deficient number, since it is larger than the sum of its proper divisors (1).
121111111111031 is an equidigital number, since it uses as much as digits as its factorization.
121111111111031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 17.
Adding to 121111111111031 its reverse (130111111111121), we get a palindrome (251222222222152).
The spelling of 121111111111031 in words is "one hundred twenty-one trillion, one hundred eleven billion, one hundred eleven million, one hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •