Base | Representation |
---|---|
bin | 11001010101001111000010… |
… | …001010111100011110111111 |
3 | 112121110201202022221212101101 |
4 | 121111033002022330132333 |
5 | 104100322012032340111 |
6 | 1032541123205553531 |
7 | 32316064632560152 |
oct | 3125170212743677 |
9 | 477421668855341 |
10 | 111410414340031 |
11 | 32553989482274 |
12 | 105b41024158a7 |
13 | 4a21c596881c1 |
14 | 1d72415727c99 |
15 | cd3091cc7bc1 |
hex | 6553c22bc7bf |
111410414340031 has 2 divisors, whose sum is σ = 111410414340032. Its totient is φ = 111410414340030.
The previous prime is 111410414340013. The next prime is 111410414340037. The reversal of 111410414340031 is 130043414014111.
Together with previous prime (111410414340013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111410414340031 - 239 = 110860658526143 is a prime.
It is a super-2 number, since 2×1114104143400312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111410414340037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55705207170015 + 55705207170016.
It is an arithmetic number, because the mean of its divisors is an integer number (55705207170016).
Almost surely, 2111410414340031 is an apocalyptic number.
111410414340031 is a deficient number, since it is larger than the sum of its proper divisors (1).
111410414340031 is an equidigital number, since it uses as much as digits as its factorization.
111410414340031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
Adding to 111410414340031 its reverse (130043414014111), we get a palindrome (241453828354142).
The spelling of 111410414340031 in words is "one hundred eleven trillion, four hundred ten billion, four hundred fourteen million, three hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •