Base | Representation |
---|---|
bin | 11001001111011101001100… |
… | …11111011000100011100101 |
3 | 21021112101101021012011211201 |
4 | 30213232212133120203211 |
5 | 24233410112314023414 |
6 | 314015223334002501 |
7 | 14456136446004643 |
oct | 1447564637304345 |
9 | 237471337164751 |
10 | 55506655611109 |
11 | 1676027104519a |
12 | 628568a7a6431 |
13 | 24c834179aa21 |
14 | d9c7720c4193 |
15 | 663cc7452574 |
hex | 327ba67d88e5 |
55506655611109 has 2 divisors, whose sum is σ = 55506655611110. Its totient is φ = 55506655611108.
The previous prime is 55506655611107. The next prime is 55506655611191. The reversal of 55506655611109 is 90111655660555.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 35922977242084 + 19583678369025 = 5993578^2 + 4425345^2 .
It is a cyclic number.
It is not a de Polignac number, because 55506655611109 - 21 = 55506655611107 is a prime.
Together with 55506655611107, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 55506655611109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55506655611107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27753327805554 + 27753327805555.
It is an arithmetic number, because the mean of its divisors is an integer number (27753327805555).
Almost surely, 255506655611109 is an apocalyptic number.
It is an amenable number.
55506655611109 is a deficient number, since it is larger than the sum of its proper divisors (1).
55506655611109 is an equidigital number, since it uses as much as digits as its factorization.
55506655611109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6075000, while the sum is 55.
The spelling of 55506655611109 in words is "fifty-five trillion, five hundred six billion, six hundred fifty-five million, six hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •