Base | Representation |
---|---|
bin | 1001011010001011… |
… | …00111001110110111 |
3 | 111001001010101112100 |
4 | 10231011213032313 |
5 | 40321130212211 |
6 | 2153125153143 |
7 | 236115206601 |
oct | 45505471667 |
9 | 14031111470 |
10 | 5051413431 |
11 | 2162433749 |
12 | b8b85b7b3 |
13 | 6266c043c |
14 | 35cc46171 |
15 | 1e8710156 |
hex | 12d1673b7 |
5051413431 has 6 divisors (see below), whose sum is σ = 7296486080. Its totient is φ = 3367608948.
The previous prime is 5051413429. The next prime is 5051413453. The reversal of 5051413431 is 1343141505.
It is a happy number.
It is not a de Polignac number, because 5051413431 - 21 = 5051413429 is a prime.
It is a super-2 number, since 2×50514134312 = 51033555301774383522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5051413395 and 5051413404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5051413421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 280634071 + ... + 280634088.
Almost surely, 25051413431 is an apocalyptic number.
5051413431 is a deficient number, since it is larger than the sum of its proper divisors (2245072649).
5051413431 is a wasteful number, since it uses less digits than its factorization.
5051413431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561268165 (or 561268162 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 5051413431 is about 71073.2961878088. The cubic root of 5051413431 is about 1715.8170202386.
Adding to 5051413431 its reverse (1343141505), we get a palindrome (6394554936).
The spelling of 5051413431 in words is "five billion, fifty-one million, four hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •