Base | Representation |
---|---|
bin | 1001100000011111… |
… | …10011001011000111 |
3 | 111011201212011121101 |
4 | 10300033303023013 |
5 | 40423212243211 |
6 | 2202301200531 |
7 | 240330546433 |
oct | 46017631307 |
9 | 14151764541 |
10 | 5104415431 |
11 | 218a344955 |
12 | ba5560147 |
13 | 63468a07b |
14 | 365cc19c3 |
15 | 1ed1ce5c1 |
hex | 1303f32c7 |
5104415431 has 2 divisors, whose sum is σ = 5104415432. Its totient is φ = 5104415430.
The previous prime is 5104415399. The next prime is 5104415443. The reversal of 5104415431 is 1345144015.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5104415431 - 25 = 5104415399 is a prime.
It is a super-2 number, since 2×51044154312 = 52110113784461831522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5104415431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5104419431) 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, 2552207715 + 2552207716.
It is an arithmetic number, because the mean of its divisors is an integer number (2552207716).
Almost surely, 25104415431 is an apocalyptic number.
5104415431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5104415431 is an equidigital number, since it uses as much as digits as its factorization.
5104415431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 28.
The square root of 5104415431 is about 71445.1917976290. The cubic root of 5104415431 is about 1721.7972280340.
Adding to 5104415431 its reverse (1345144015), we get a palindrome (6449559446).
The spelling of 5104415431 in words is "five billion, one hundred four million, four hundred fifteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •