Base | Representation |
---|---|
bin | 1001111100100101… |
… | …11010001001000111 |
3 | 111210011100202201212 |
4 | 10332102322021013 |
5 | 41414032031211 |
6 | 2241521042035 |
7 | 246222124664 |
oct | 47622721107 |
9 | 14704322655 |
10 | 5340111431 |
11 | 22a0398836 |
12 | 105048631b |
13 | 671461b65 |
14 | 389316a6b |
15 | 213c3a38b |
hex | 13e4ba247 |
5340111431 has 2 divisors, whose sum is σ = 5340111432. Its totient is φ = 5340111430.
The previous prime is 5340111421. The next prime is 5340111437. The reversal of 5340111431 is 1341110435.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5340111431 - 230 = 4266369607 is a prime.
It is a super-2 number, since 2×53401114312 = 57033580190993735522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5340111397 and 5340111406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5340111437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2670055715 + 2670055716.
It is an arithmetic number, because the mean of its divisors is an integer number (2670055716).
Almost surely, 25340111431 is an apocalyptic number.
5340111431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5340111431 is an equidigital number, since it uses as much as digits as its factorization.
5340111431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 23.
The square root of 5340111431 is about 73076.0660613309. The cubic root of 5340111431 is about 1747.9007678562.
Adding to 5340111431 its reverse (1341110435), we get a palindrome (6681221866).
The spelling of 5340111431 in words is "five billion, three hundred forty million, one hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •