Base | Representation |
---|---|
bin | 111000011001011000… |
… | …1111010110101001001 |
3 | 102120121102202211122221 |
4 | 1300302301322311021 |
5 | 3441013410443423 |
6 | 131345421414041 |
7 | 11515146531112 |
oct | 1606261726511 |
9 | 376542684587 |
10 | 121111031113 |
11 | 473aa024256 |
12 | 1b57ba0a321 |
13 | b56142b027 |
14 | 5c0cb17209 |
15 | 323c7b9e5d |
hex | 1c32c7ad49 |
121111031113 has 2 divisors, whose sum is σ = 121111031114. Its totient is φ = 121111031112.
The previous prime is 121111031099. The next prime is 121111031189. The reversal of 121111031113 is 311130111121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119330866249 + 1780164864 = 345443^2 + 42192^2 .
It is a cyclic number.
It is not a de Polignac number, because 121111031113 - 217 = 121110900041 is a prime.
It is not a weakly prime, because it can be changed into another prime (121111031413) 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, 60555515556 + 60555515557.
It is an arithmetic number, because the mean of its divisors is an integer number (60555515557).
Almost surely, 2121111031113 is an apocalyptic number.
It is an amenable number.
121111031113 is a deficient number, since it is larger than the sum of its proper divisors (1).
121111031113 is an equidigital number, since it uses as much as digits as its factorization.
121111031113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 121111031113 its reverse (311130111121), we get a palindrome (432241142234).
The spelling of 121111031113 in words is "one hundred twenty-one billion, one hundred eleven million, thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •