Base | Representation |
---|---|
bin | 1001011001000111… |
… | …10001101101000111 |
3 | 111000102102202011211 |
4 | 10230203301231013 |
5 | 40311342342211 |
6 | 2152211112251 |
7 | 235646624542 |
oct | 45443615507 |
9 | 14012382154 |
10 | 5042543431 |
11 | 2158425572 |
12 | b888a2687 |
13 | 624906013 |
14 | 35b9b7859 |
15 | 1e7a5be21 |
hex | 12c8f1b47 |
5042543431 has 2 divisors, whose sum is σ = 5042543432. Its totient is φ = 5042543430.
The previous prime is 5042543423. The next prime is 5042543459. The reversal of 5042543431 is 1343452405.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5042543431 - 23 = 5042543423 is a prime.
It is a super-2 number, since 2×50425434312 = 50854488507042503522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5042543393 and 5042543402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5042543411) 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, 2521271715 + 2521271716.
It is an arithmetic number, because the mean of its divisors is an integer number (2521271716).
Almost surely, 25042543431 is an apocalyptic number.
5042543431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5042543431 is an equidigital number, since it uses as much as digits as its factorization.
5042543431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 31.
The square root of 5042543431 is about 71010.8684005484. The cubic root of 5042543431 is about 1714.8121388685.
Adding to 5042543431 its reverse (1343452405), we get a palindrome (6385995836).
The spelling of 5042543431 in words is "five billion, forty-two million, five hundred forty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •