Base | Representation |
---|---|
bin | 1001010101100101100111110… |
… | …1000000111111110100001101 |
3 | 10012011102211020122022201000101 |
4 | 2111121121331000333310031 |
5 | 1142110141144234240221 |
6 | 10245234444552531101 |
7 | 255253433035024003 |
oct | 22531317500776415 |
9 | 3164384218281011 |
10 | 657054784290061 |
11 | 1803a3407392353 |
12 | 618397519b0a91 |
13 | 2228200085b9b1 |
14 | b83789a98ca73 |
15 | 50e6781e18d91 |
hex | 255967d03fd0d |
657054784290061 has 2 divisors, whose sum is σ = 657054784290062. Its totient is φ = 657054784290060.
The previous prime is 657054784290019. The next prime is 657054784290067. The reversal of 657054784290061 is 160092487450756.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 585677801009961 + 71376983280100 = 24200781^2 + 8448490^2 .
It is a cyclic number.
It is not a de Polignac number, because 657054784290061 - 239 = 656505028476173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 657054784289975 and 657054784290002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (657054784290067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 328527392145030 + 328527392145031.
It is an arithmetic number, because the mean of its divisors is an integer number (328527392145031).
Almost surely, 2657054784290061 is an apocalyptic number.
It is an amenable number.
657054784290061 is a deficient number, since it is larger than the sum of its proper divisors (1).
657054784290061 is an equidigital number, since it uses as much as digits as its factorization.
657054784290061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 101606400, while the sum is 64.
The spelling of 657054784290061 in words is "six hundred fifty-seven trillion, fifty-four billion, seven hundred eighty-four million, two hundred ninety thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •