Base | Representation |
---|---|
bin | 100110010010110101101… |
… | …1100111011111000111101 |
3 | 200122011002010002112101100 |
4 | 1030211223130323320331 |
5 | 1142212401221410203 |
6 | 15105504014203313 |
7 | 1052151313115523 |
oct | 114455334737075 |
9 | 20564063075340 |
10 | 5263137685053 |
11 | 174a0a2016a66 |
12 | 7100461b3539 |
13 | 2c2408c015a1 |
14 | 142a46d24313 |
15 | 91d8dad7ea3 |
hex | 4c96b73be3d |
5263137685053 has 12 divisors (see below), whose sum is σ = 7610423459548. Its totient is φ = 3505013778240.
The previous prime is 5263137685051. The next prime is 5263137685073. The reversal of 5263137685053 is 3505867313625.
5263137685053 is a `hidden beast` number, since 5 + 2 + 63 + 1 + 3 + 76 + 8 + 505 + 3 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 284406756804 + 4978730928249 = 533298^2 + 2231307^2 .
It is not a de Polignac number, because 5263137685053 - 21 = 5263137685051 is a prime.
It is a super-2 number, since 2×52631376850532 (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 (5263137685051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 312047638 + ... + 312064503.
Almost surely, 25263137685053 is an apocalyptic number.
It is an amenable number.
5263137685053 is a deficient number, since it is larger than the sum of its proper divisors (2347285774495).
5263137685053 is a wasteful number, since it uses less digits than its factorization.
5263137685053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 624113084 (or 624113081 counting only the distinct ones).
The product of its (nonzero) digits is 13608000, while the sum is 54.
The spelling of 5263137685053 in words is "five trillion, two hundred sixty-three billion, one hundred thirty-seven million, six hundred eighty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •