Base | Representation |
---|---|
bin | 1001010100010111… |
… | …11110101000110001 |
3 | 110220122120001120001 |
4 | 10222023332220301 |
5 | 40221201004023 |
6 | 2144230150001 |
7 | 234654451315 |
oct | 45213765061 |
9 | 13818501501 |
10 | 5002750513 |
11 | 2137a16562 |
12 | b774b2301 |
13 | 6195b2807 |
14 | 3565b9b45 |
15 | 1e42eb6ad |
hex | 12a2fea31 |
5002750513 has 2 divisors, whose sum is σ = 5002750514. Its totient is φ = 5002750512.
The previous prime is 5002750477. The next prime is 5002750553. The reversal of 5002750513 is 3150572005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4561246369 + 441504144 = 67537^2 + 21012^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5002750513 is a prime.
It is not a weakly prime, because it can be changed into another prime (5002750553) 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, 2501375256 + 2501375257.
It is an arithmetic number, because the mean of its divisors is an integer number (2501375257).
Almost surely, 25002750513 is an apocalyptic number.
It is an amenable number.
5002750513 is a deficient number, since it is larger than the sum of its proper divisors (1).
5002750513 is an equidigital number, since it uses as much as digits as its factorization.
5002750513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5250, while the sum is 28.
The square root of 5002750513 is about 70730.1245085854. The cubic root of 5002750513 is about 1710.2894432700.
The spelling of 5002750513 in words is "five billion, two million, seven hundred fifty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •