Base | Representation |
---|---|
bin | 100101000111000010010… |
… | …0111011111011110110111 |
3 | 200001120220020110111012111 |
4 | 1022032010213133132313 |
5 | 1132031004342003211 |
6 | 14503022521231451 |
7 | 1034326312153012 |
oct | 112160447373667 |
9 | 20046806414174 |
10 | 5100351125431 |
11 | 1697057276371 |
12 | 6a4595332587 |
13 | 2acc65562223 |
14 | 138c032c8379 |
15 | 8ca126b8421 |
hex | 4a3849df7b7 |
5100351125431 has 16 divisors (see below), whose sum is σ = 5292697584960. Its totient is φ = 4909126763520.
The previous prime is 5100351125407. The next prime is 5100351125533. The reversal of 5100351125431 is 1345211530015.
It is a cyclic number.
It is not a de Polignac number, because 5100351125431 - 227 = 5100216907703 is a prime.
It is a super-2 number, since 2×51003511254312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5100351125393 and 5100351125402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5100351105431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11750766 + ... + 12177076.
It is an arithmetic number, because the mean of its divisors is an integer number (330793599060).
Almost surely, 25100351125431 is an apocalyptic number.
5100351125431 is a deficient number, since it is larger than the sum of its proper divisors (192346459529).
5100351125431 is a wasteful number, since it uses less digits than its factorization.
5100351125431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427626.
The product of its (nonzero) digits is 9000, while the sum is 31.
Adding to 5100351125431 its reverse (1345211530015), we get a palindrome (6445562655446).
The spelling of 5100351125431 in words is "five trillion, one hundred billion, three hundred fifty-one million, one hundred twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •