Base | Representation |
---|---|
bin | 110011101100010110… |
… | …1111011101101101001 |
3 | 101121112111002110222202 |
4 | 1213120231323231221 |
5 | 3304322041231441 |
6 | 122555231425545 |
7 | 11006635204412 |
oct | 1473055735551 |
9 | 347474073882 |
10 | 111010102121 |
11 | 43096343856 |
12 | 196210852b5 |
13 | a611863279 |
14 | 5531400809 |
15 | 2d4ab2219b |
hex | 19d8b7bb69 |
111010102121 has 2 divisors, whose sum is σ = 111010102122. Its totient is φ = 111010102120.
The previous prime is 111010102103. The next prime is 111010102129. The reversal of 111010102121 is 121201010111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 80267389225 + 30742712896 = 283315^2 + 175336^2 .
It is a cyclic number.
It is not a de Polignac number, because 111010102121 - 214 = 111010085737 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (111010102129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55505051060 + 55505051061.
It is an arithmetic number, because the mean of its divisors is an integer number (55505051061).
Almost surely, 2111010102121 is an apocalyptic number.
It is an amenable number.
111010102121 is a deficient number, since it is larger than the sum of its proper divisors (1).
111010102121 is an equidigital number, since it uses as much as digits as its factorization.
111010102121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 111010102121 its reverse (121201010111), we get a palindrome (232211112232).
The spelling of 111010102121 in words is "one hundred eleven billion, ten million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •