Base | Representation |
---|---|
bin | 11001001000111100111110… |
… | …01001110101011010110101 |
3 | 21020202000120212011110020121 |
4 | 30210132133021311122311 |
5 | 24221224440210103021 |
6 | 313324425424531541 |
7 | 14434036042356235 |
oct | 1444363711653265 |
9 | 236660525143217 |
10 | 55283194222261 |
11 | 1668451a9aa335 |
12 | 624a305a80bb1 |
13 | 24b024b935c55 |
14 | d91a1412dcc5 |
15 | 65d099430741 |
hex | 32479f2756b5 |
55283194222261 has 2 divisors, whose sum is σ = 55283194222262. Its totient is φ = 55283194222260.
The previous prime is 55283194222259. The next prime is 55283194222283. The reversal of 55283194222261 is 16222249138255.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29697867680625 + 25585326541636 = 5449575^2 + 5058194^2 .
It is a cyclic number.
It is not a de Polignac number, because 55283194222261 - 21 = 55283194222259 is a prime.
Together with 55283194222259, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 55283194222199 and 55283194222208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55283194225261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27641597111130 + 27641597111131.
It is an arithmetic number, because the mean of its divisors is an integer number (27641597111131).
Almost surely, 255283194222261 is an apocalyptic number.
It is an amenable number.
55283194222261 is a deficient number, since it is larger than the sum of its proper divisors (1).
55283194222261 is an equidigital number, since it uses as much as digits as its factorization.
55283194222261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 4147200, while the sum is 52.
The spelling of 55283194222261 in words is "fifty-five trillion, two hundred eighty-three billion, one hundred ninety-four million, two hundred twenty-two thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •