Base | Representation |
---|---|
bin | 100100011001101101001… |
… | …0110011100101000001001 |
3 | 122201021122001000122110212 |
4 | 1020303122112130220021 |
5 | 1123432123321000212 |
6 | 14350203205250505 |
7 | 1024312063652123 |
oct | 110633226345011 |
9 | 18637561018425 |
10 | 5003005250057 |
11 | 16598430433a1 |
12 | 689748403a35 |
13 | 2a3a20896339 |
14 | 13420a958213 |
15 | 8a2164a0e22 |
hex | 48cda59ca09 |
5003005250057 has 4 divisors (see below), whose sum is σ = 5012607947796. Its totient is φ = 4993402552320.
The previous prime is 5003005249997. The next prime is 5003005250059. The reversal of 5003005250057 is 7500525003005.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2935451715856 + 2067553534201 = 1713316^2 + 1437899^2 .
It is a cyclic number.
It is not a de Polignac number, because 5003005250057 - 214 = 5003005233673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5003005250059) 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 in 3 ways as a sum of consecutive naturals, for example, 4801348088 + ... + 4801349129.
It is an arithmetic number, because the mean of its divisors is an integer number (1253151986949).
Almost surely, 25003005250057 is an apocalyptic number.
It is an amenable number.
5003005250057 is a deficient number, since it is larger than the sum of its proper divisors (9602697739).
5003005250057 is an equidigital number, since it uses as much as digits as its factorization.
5003005250057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9602697738.
The product of its (nonzero) digits is 26250, while the sum is 32.
The spelling of 5003005250057 in words is "five trillion, three billion, five million, two hundred fifty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •