Search a number
-
+
55323313111061 is a prime number
BaseRepresentation
bin11001001010000111101100…
…11011010000000000010101
321020212212010210221011111222
430211003312123100000111
524222404121124023221
6313355102411540125
714436656162322512
oct1445036633200025
9236785123834458
1055323313111061
111669a537a80286
12625604175a645
1324b3c735136c8
14d9393c408309
1565e14659d9ab
hex3250f66d0015

55323313111061 has 2 divisors, whose sum is σ = 55323313111062. Its totient is φ = 55323313111060.

The previous prime is 55323313111037. The next prime is 55323313111069. The reversal of 55323313111061 is 16011131332355.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 37275982424836 + 18047330686225 = 6105406^2 + 4248215^2 .

It is a cyclic number.

It is not a de Polignac number, because 55323313111061 - 226 = 55323246002197 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (55323313111069) 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, 27661656555530 + 27661656555531.

It is an arithmetic number, because the mean of its divisors is an integer number (27661656555531).

Almost surely, 255323313111061 is an apocalyptic number.

It is an amenable number.

55323313111061 is a deficient number, since it is larger than the sum of its proper divisors (1).

55323313111061 is an equidigital number, since it uses as much as digits as its factorization.

55323313111061 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 24300, while the sum is 35.

The spelling of 55323313111061 in words is "fifty-five trillion, three hundred twenty-three billion, three hundred thirteen million, one hundred eleven thousand, sixty-one".