Base | Representation |
---|---|
bin | 101001100011001011011… |
… | …1011101001101100010101 |
3 | 202012220220121112211100120 |
4 | 1103012112323221230111 |
5 | 1222030143200143203 |
6 | 20051215415102153 |
7 | 1126400412015213 |
oct | 123062673515425 |
9 | 22186817484316 |
10 | 5710543756053 |
11 | 1901912093134 |
12 | 7828a9671959 |
13 | 32566aa83ac6 |
14 | 15a56b115cb3 |
15 | 9d827294b53 |
hex | 53196ee9b15 |
5710543756053 has 16 divisors (see below), whose sum is σ = 7731491504640. Its totient is φ = 3748368332016.
The previous prime is 5710543756033. The next prime is 5710543756063. The reversal of 5710543756053 is 3506573450175.
It is not a de Polignac number, because 5710543756053 - 213 = 5710543747861 is a prime.
It is a super-2 number, since 2×57105437560532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5710543755987 and 5710543756005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5710543756033) 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 15 ways as a sum of consecutive naturals, for example, 6556975 + ... + 7376652.
It is an arithmetic number, because the mean of its divisors is an integer number (483218219040).
Almost surely, 25710543756053 is an apocalyptic number.
It is an amenable number.
5710543756053 is a deficient number, since it is larger than the sum of its proper divisors (2020947748587).
5710543756053 is a wasteful number, since it uses less digits than its factorization.
5710543756053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13935736.
The product of its (nonzero) digits is 6615000, while the sum is 51.
The spelling of 5710543756053 in words is "five trillion, seven hundred ten billion, five hundred forty-three million, seven hundred fifty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •