Base | Representation |
---|---|
bin | 110101000111000011… |
… | …111010111110000001 |
3 | 12110012021221211201211 |
4 | 311013003322332001 |
5 | 1413242324111103 |
6 | 42110413530121 |
7 | 4056114450562 |
oct | 650703727601 |
9 | 173167854654 |
10 | 57026785153 |
11 | 22204151808 |
12 | b0761a3941 |
13 | 54ba793570 |
14 | 2a8da60169 |
15 | 173b70036d |
hex | d470faf81 |
57026785153 has 4 divisors (see below), whose sum is σ = 61413460948. Its totient is φ = 52640109360.
The previous prime is 57026785121. The next prime is 57026785169. The reversal of 57026785153 is 35158762075.
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 2472774529 + 54554010624 = 49727^2 + 233568^2 .
It is a cyclic number.
It is not a de Polignac number, because 57026785153 - 25 = 57026785121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 57026785097 and 57026785106.
It is not an unprimeable number, because it can be changed into a prime (57026788153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2193337878 + ... + 2193337903.
It is an arithmetic number, because the mean of its divisors is an integer number (15353365237).
Almost surely, 257026785153 is an apocalyptic number.
It is an amenable number.
57026785153 is a deficient number, since it is larger than the sum of its proper divisors (4386675795).
57026785153 is a wasteful number, since it uses less digits than its factorization.
57026785153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4386675794.
The product of its (nonzero) digits is 1764000, while the sum is 49.
The spelling of 57026785153 in words is "fifty-seven billion, twenty-six million, seven hundred eighty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •