Base | Representation |
---|---|
bin | 100100111011100100001… |
… | …0101111000010000111001 |
3 | 122222020022111001110121121 |
4 | 1021313020111320100321 |
5 | 1131130032143232012 |
6 | 14443430310305241 |
7 | 1032465004235116 |
oct | 111671025702071 |
9 | 18866274043547 |
10 | 5075717555257 |
11 | 1687666266508 |
12 | 69b85b658221 |
13 | 2aa83ac152bb |
14 | 13794788790d |
15 | 8c06ec77a07 |
hex | 49dc8578439 |
5075717555257 has 4 divisors (see below), whose sum is σ = 5075788259556. Its totient is φ = 5075646850960.
The previous prime is 5075717555219. The next prime is 5075717555263. The reversal of 5075717555257 is 7525557175705.
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 333932581161 + 4741784974096 = 577869^2 + 2177564^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5075717555257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5075717555195 and 5075717555204.
It is not an unprimeable number, because it can be changed into a prime (5075717555267) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35244358 + ... + 35388079.
It is an arithmetic number, because the mean of its divisors is an integer number (1268947064889).
Almost surely, 25075717555257 is an apocalyptic number.
It is an amenable number.
5075717555257 is a deficient number, since it is larger than the sum of its proper divisors (70704299).
5075717555257 is an equidigital number, since it uses as much as digits as its factorization.
5075717555257 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70704298.
The product of its (nonzero) digits is 75031250, while the sum is 61.
The spelling of 5075717555257 in words is "five trillion, seventy-five billion, seven hundred seventeen million, five hundred fifty-five thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •