Base | Representation |
---|---|
bin | 110011101100001011… |
… | …1000101110011001001 |
3 | 101121112001211020222222 |
4 | 1213120113011303021 |
5 | 3304314023122441 |
6 | 122554455223425 |
7 | 11006533254605 |
oct | 1473027056311 |
9 | 347461736888 |
10 | 111004114121 |
11 | 43092a2399a |
12 | 1961b077b75 |
13 | a610547884 |
14 | 55306c2505 |
15 | 2d4a33cd4b |
hex | 19d85c5cc9 |
111004114121 has 2 divisors, whose sum is σ = 111004114122. Its totient is φ = 111004114120.
The previous prime is 111004114079. The next prime is 111004114129. The reversal of 111004114121 is 121411400111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61125145225 + 49878968896 = 247235^2 + 223336^2 .
It is a cyclic number.
It is not a de Polignac number, because 111004114121 - 26 = 111004114057 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 111004114121.
It is not a weakly prime, because it can be changed into another prime (111004114129) 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, 55502057060 + 55502057061.
It is an arithmetic number, because the mean of its divisors is an integer number (55502057061).
Almost surely, 2111004114121 is an apocalyptic number.
It is an amenable number.
111004114121 is a deficient number, since it is larger than the sum of its proper divisors (1).
111004114121 is an equidigital number, since it uses as much as digits as its factorization.
111004114121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 111004114121 its reverse (121411400111), we get a palindrome (232415514232).
The spelling of 111004114121 in words is "one hundred eleven billion, four million, one hundred fourteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •