Base | Representation |
---|---|
bin | 1001100000010111… |
… | …11110000011100111 |
3 | 111011122222011101012 |
4 | 10300023332003213 |
5 | 40422433131211 |
6 | 2202223452435 |
7 | 240316165346 |
oct | 46013760347 |
9 | 14148864335 |
10 | 5103411431 |
11 | 21898195a8 |
12 | ba515711b |
13 | 6343c80a1 |
14 | 365addb5d |
15 | 1ed081d8b |
hex | 1302fe0e7 |
5103411431 has 2 divisors, whose sum is σ = 5103411432. Its totient is φ = 5103411430.
The previous prime is 5103411427. The next prime is 5103411451. The reversal of 5103411431 is 1341143015.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5103411431 - 22 = 5103411427 is a prime.
It is a super-2 number, since 2×51034114312 = 52089616468122935522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5103411397 and 5103411406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5103411451) 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, 2551705715 + 2551705716.
It is an arithmetic number, because the mean of its divisors is an integer number (2551705716).
Almost surely, 25103411431 is an apocalyptic number.
5103411431 is a deficient number, since it is larger than the sum of its proper divisors (1).
5103411431 is an equidigital number, since it uses as much as digits as its factorization.
5103411431 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 5103411431 is about 71438.1650870177. The cubic root of 5103411431 is about 1721.6843324574.
Adding to 5103411431 its reverse (1341143015), we get a palindrome (6444554446).
The spelling of 5103411431 in words is "five billion, one hundred three million, four hundred eleven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •