Base | Representation |
---|---|
bin | 1001011001110000… |
… | …10101001001101111 |
3 | 111000210120111020001 |
4 | 10230320111021233 |
5 | 40314232302003 |
6 | 2152522405131 |
7 | 236043465316 |
oct | 45470251157 |
9 | 14023514201 |
10 | 5047931503 |
11 | 216047571a |
12 | b8a6607a7 |
13 | 625a71624 |
14 | 35c5bb27d |
15 | 1e827361d |
hex | 12ce1526f |
5047931503 has 2 divisors, whose sum is σ = 5047931504. Its totient is φ = 5047931502.
The previous prime is 5047931479. The next prime is 5047931513. The reversal of 5047931503 is 3051397405.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5047931503 - 29 = 5047930991 is a prime.
It is a super-2 number, since 2×50479315032 = 50963224917959678018, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5047931513) 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, 2523965751 + 2523965752.
It is an arithmetic number, because the mean of its divisors is an integer number (2523965752).
Almost surely, 25047931503 is an apocalyptic number.
5047931503 is a deficient number, since it is larger than the sum of its proper divisors (1).
5047931503 is an equidigital number, since it uses as much as digits as its factorization.
5047931503 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56700, while the sum is 37.
The square root of 5047931503 is about 71048.7966330184. The cubic root of 5047931503 is about 1715.4226933414.
The spelling of 5047931503 in words is "five billion, forty-seven million, nine hundred thirty-one thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •