Base | Representation |
---|---|
bin | 110011010110100111… |
… | …101001001100100101 |
3 | 12021022211020200201011 |
4 | 303112213221030211 |
5 | 1400411410333013 |
6 | 41155304302221 |
7 | 3661300010326 |
oct | 632647511445 |
9 | 167284220634 |
10 | 55140324133 |
11 | 21426303714 |
12 | a82a471971 |
13 | 52799c033b |
14 | 29512bc44d |
15 | 167acb8c3d |
hex | cd69e9325 |
55140324133 has 2 divisors, whose sum is σ = 55140324134. Its totient is φ = 55140324132.
The previous prime is 55140324119. The next prime is 55140324167. The reversal of 55140324133 is 33142304155.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29303619489 + 25836704644 = 171183^2 + 160738^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55140324133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 55140324095 and 55140324104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55140325133) 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 as a sum of consecutive naturals, namely, 27570162066 + 27570162067.
It is an arithmetic number, because the mean of its divisors is an integer number (27570162067).
Almost surely, 255140324133 is an apocalyptic number.
It is an amenable number.
55140324133 is a deficient number, since it is larger than the sum of its proper divisors (1).
55140324133 is an equidigital number, since it uses as much as digits as its factorization.
55140324133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 55140324133 its reverse (33142304155), we get a palindrome (88282628288).
The spelling of 55140324133 in words is "fifty-five billion, one hundred forty million, three hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •