Base | Representation |
---|---|
bin | 111111011001011001100100… |
… | …0101101100001110001010101 |
3 | 2201010110022112211001111002012 |
4 | 1332302303020231201301111 |
5 | 1041042422412223041321 |
6 | 5254002242454354005 |
7 | 225313334351666165 |
oct | 17662631055416125 |
9 | 2633408484044065 |
10 | 557644741221461 |
11 | 151756896718683 |
12 | 5266335365b905 |
13 | 1ac2089a78660a |
14 | 9b9c21428a5a5 |
15 | 447094594d05b |
hex | 1fb2cc8b61c55 |
557644741221461 has 2 divisors, whose sum is σ = 557644741221462. Its totient is φ = 557644741221460.
The previous prime is 557644741221433. The next prime is 557644741221481. The reversal of 557644741221461 is 164122147446755.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 460389760323025 + 97254980898436 = 21456695^2 + 9861794^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-557644741221461 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 557644741221461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (557644741221481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 278822370610730 + 278822370610731.
It is an arithmetic number, because the mean of its divisors is an integer number (278822370610731).
Almost surely, 2557644741221461 is an apocalyptic number.
It is an amenable number.
557644741221461 is a deficient number, since it is larger than the sum of its proper divisors (1).
557644741221461 is an equidigital number, since it uses as much as digits as its factorization.
557644741221461 is an evil number, because the sum of its binary digits is even.
The product of its digits is 45158400, while the sum is 59.
The spelling of 557644741221461 in words is "five hundred fifty-seven trillion, six hundred forty-four billion, seven hundred forty-one million, two hundred twenty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.271 sec. • engine limits •