Base | Representation |
---|---|
bin | 110011111000010100… |
… | …0110100010000011001 |
3 | 101122120110020020110012 |
4 | 1213300220310100121 |
5 | 3311132310222131 |
6 | 123103125131305 |
7 | 11022610252124 |
oct | 1476050642031 |
9 | 348513206405 |
10 | 111411414041 |
11 | 432819253a4 |
12 | 19713559b35 |
13 | a676a43a45 |
14 | 556c8273bb |
15 | 2d70e9452b |
hex | 19f0a34419 |
111411414041 has 2 divisors, whose sum is σ = 111411414042. Its totient is φ = 111411414040.
The previous prime is 111411413959. The next prime is 111411414089. The reversal of 111411414041 is 140414114111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107413507600 + 3997906441 = 327740^2 + 63229^2 .
It is an emirp because it is prime and its reverse (140414114111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111411414041 - 218 = 111411151897 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 111411413998 and 111411414016.
It is not a weakly prime, because it can be changed into another prime (111411414841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55705707020 + 55705707021.
It is an arithmetic number, because the mean of its divisors is an integer number (55705707021).
Almost surely, 2111411414041 is an apocalyptic number.
It is an amenable number.
111411414041 is a deficient number, since it is larger than the sum of its proper divisors (1).
111411414041 is an equidigital number, since it uses as much as digits as its factorization.
111411414041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 111411414041 its reverse (140414114111), we get a palindrome (251825528152).
The spelling of 111411414041 in words is "one hundred eleven billion, four hundred eleven million, four hundred fourteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •