Base | Representation |
---|---|
bin | 100100111010100011111… |
… | …0110010000111101011101 |
3 | 122222000202020120221121112 |
4 | 1021311013312100331131 |
5 | 1131111123304043112 |
6 | 14442432340511405 |
7 | 1032360406416146 |
oct | 111650766207535 |
9 | 18860666527545 |
10 | 5073561784157 |
11 | 168675a3a57a9 |
12 | 69b3596ab565 |
13 | 2aa5863cb2b9 |
14 | 1377c1440acd |
15 | 8be95895a22 |
hex | 49d47d90f5d |
5073561784157 has 2 divisors, whose sum is σ = 5073561784158. Its totient is φ = 5073561784156.
The previous prime is 5073561784133. The next prime is 5073561784177. The reversal of 5073561784157 is 7514871653705.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4985904931396 + 87656852761 = 2232914^2 + 296069^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5073561784157 is a prime.
It is a super-2 number, since 2×50735617841572 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5073561784096 and 5073561784105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5073561784177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2536780892078 + 2536780892079.
It is an arithmetic number, because the mean of its divisors is an integer number (2536780892079).
Almost surely, 25073561784157 is an apocalyptic number.
It is an amenable number.
5073561784157 is a deficient number, since it is larger than the sum of its proper divisors (1).
5073561784157 is an equidigital number, since it uses as much as digits as its factorization.
5073561784157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24696000, while the sum is 59.
The spelling of 5073561784157 in words is "five trillion, seventy-three billion, five hundred sixty-one million, seven hundred eighty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •