Base | Representation |
---|---|
bin | 1001100101010110… |
… | …00100111111011011 |
3 | 111021120110012210002 |
4 | 10302223010333123 |
5 | 41014122330411 |
6 | 2210313443215 |
7 | 241333542662 |
oct | 46253047733 |
9 | 14246405702 |
10 | 5145120731 |
11 | 22003173a3 |
12 | bb711050b |
13 | 63cc3c94a |
14 | 36b479dd9 |
15 | 201a7033b |
hex | 132ac4fdb |
5145120731 has 2 divisors, whose sum is σ = 5145120732. Its totient is φ = 5145120730.
The previous prime is 5145120671. The next prime is 5145120763. The reversal of 5145120731 is 1370215415.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5145120731 is a prime.
It is a super-2 number, since 2×51451207312 = 52944534673131948722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5145120694 and 5145120703.
It is not a weakly prime, because it can be changed into another prime (5145120031) 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 as a sum of consecutive naturals, namely, 2572560365 + 2572560366.
It is an arithmetic number, because the mean of its divisors is an integer number (2572560366).
Almost surely, 25145120731 is an apocalyptic number.
5145120731 is a deficient number, since it is larger than the sum of its proper divisors (1).
5145120731 is an equidigital number, since it uses as much as digits as its factorization.
5145120731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4200, while the sum is 29.
The square root of 5145120731 is about 71729.4969381495. The cubic root of 5145120731 is about 1726.3619552477.
The spelling of 5145120731 in words is "five billion, one hundred forty-five million, one hundred twenty thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •