Base | Representation |
---|---|
bin | 1010001000011100111001… |
… | …0011100110011111100111 |
3 | 1110110000002110101112010111 |
4 | 2202013032103212133213 |
5 | 2430010324212142211 |
6 | 35405442144433451 |
7 | 2226601205603062 |
oct | 242071623463747 |
9 | 43400073345114 |
10 | 11140311443431 |
11 | 3605641423115 |
12 | 12bb097918887 |
13 | 62a6b068c6b1 |
14 | 2a72a02b58d9 |
15 | 144bb98ea421 |
hex | a21ce4e67e7 |
11140311443431 has 2 divisors, whose sum is σ = 11140311443432. Its totient is φ = 11140311443430.
The previous prime is 11140311443407. The next prime is 11140311443447. The reversal of 11140311443431 is 13434411304111.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11140311443431 - 223 = 11140303054823 is a prime.
It is a super-2 number, since 2×111403114434312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11140311443393 and 11140311443402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11140311443531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5570155721715 + 5570155721716.
It is an arithmetic number, because the mean of its divisors is an integer number (5570155721716).
Almost surely, 211140311443431 is an apocalyptic number.
11140311443431 is a deficient number, since it is larger than the sum of its proper divisors (1).
11140311443431 is an equidigital number, since it uses as much as digits as its factorization.
11140311443431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 11140311443431 its reverse (13434411304111), we get a palindrome (24574722747542).
The spelling of 11140311443431 in words is "eleven trillion, one hundred forty billion, three hundred eleven million, four hundred forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •