Base | Representation |
---|---|
bin | 100100110011001011101… |
… | …1101001010101010001111 |
3 | 122220111212000210120102012 |
4 | 1021212113131022222033 |
5 | 1130331201140402342 |
6 | 14431252223051435 |
7 | 1031256645345266 |
oct | 111462735125217 |
9 | 18814760716365 |
10 | 5057717512847 |
11 | 167aa697551aa |
12 | 698277440b7b |
13 | 2a8c2c99b62c |
14 | 136b1b0495dd |
15 | 8b8698b1b82 |
hex | 4999774aa8f |
5057717512847 has 4 divisors (see below), whose sum is σ = 5058249297936. Its totient is φ = 5057185727760.
The previous prime is 5057717512777. The next prime is 5057717512933. The reversal of 5057717512847 is 7482157177505.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5057717512847 - 214 = 5057717496463 is a prime.
It is a super-2 number, since 2×50577175128472 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5057717512747) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 265878278 + ... + 265897299.
It is an arithmetic number, because the mean of its divisors is an integer number (1264562324484).
Almost surely, 25057717512847 is an apocalyptic number.
5057717512847 is a deficient number, since it is larger than the sum of its proper divisors (531785089).
5057717512847 is an equidigital number, since it uses as much as digits as its factorization.
5057717512847 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531785088.
The product of its (nonzero) digits is 19208000, while the sum is 59.
The spelling of 5057717512847 in words is "five trillion, fifty-seven billion, seven hundred seventeen million, five hundred twelve thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •