Base | Representation |
---|---|
bin | 110011111000111100… |
… | …0111100110001001111 |
3 | 101122121220202110210122 |
4 | 1213301320330301033 |
5 | 3311203144423211 |
6 | 123105155255155 |
7 | 11023253642213 |
oct | 1476170746117 |
9 | 348556673718 |
10 | 111432420431 |
11 | 43292772852 |
12 | 1971a5aa4bb |
13 | a67b1ba267 |
14 | 5571534943 |
15 | 2d72c436db |
hex | 19f1e3cc4f |
111432420431 has 2 divisors, whose sum is σ = 111432420432. Its totient is φ = 111432420430.
The previous prime is 111432420413. The next prime is 111432420493. The reversal of 111432420431 is 134024234111.
Together with previous prime (111432420413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 111432420431 - 218 = 111432158287 is a prime.
It is a super-2 number, since 2×1114324204312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111432420431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111432420331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55716210215 + 55716210216.
It is an arithmetic number, because the mean of its divisors is an integer number (55716210216).
Almost surely, 2111432420431 is an apocalyptic number.
111432420431 is a deficient number, since it is larger than the sum of its proper divisors (1).
111432420431 is an equidigital number, since it uses as much as digits as its factorization.
111432420431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 111432420431 its reverse (134024234111), we get a palindrome (245456654542).
The spelling of 111432420431 in words is "one hundred eleven billion, four hundred thirty-two million, four hundred twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •