Search a number
-
+
105555555913 is a prime number
BaseRepresentation
bin110001001001110011…
…0011111011001001001
3101002110100101211020211
41202103212133121021
53212134210242123
6120254101521121
710424523264343
oct1422346373111
9332410354224
10105555555913
11408473a5525
121855a4131a1
139c527a5632
145174c1a293
152b2bd3040d
hex189399f649

105555555913 has 2 divisors, whose sum is σ = 105555555914. Its totient is φ = 105555555912.

The previous prime is 105555555901. The next prime is 105555555943. The reversal of 105555555913 is 319555555501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 105522974649 + 32581264 = 324843^2 + 5708^2 .

It is a cyclic number.

It is not a de Polignac number, because 105555555913 - 229 = 105018685001 is a prime.

It is a super-2 number, since 2×1055555559132 (a number of 23 digits) contains 22 as substring.

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

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

Almost surely, 2105555555913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2109375, while the sum is 49.

The spelling of 105555555913 in words is "one hundred five billion, five hundred fifty-five million, five hundred fifty-five thousand, nine hundred thirteen".