Search a number
-
+
105855531010601 is a prime number
BaseRepresentation
bin11000000100011001101001…
…010100101100101000101001
3111212210200121221222000110212
4120010121221110230220221
5102333314111414314401
61013045205401550505
731203544511411501
oct3004315124545051
9455720557860425
10105855531010601
1130802095675619
12ba576171a5435
13470b197aa7218
141c1d613a5aa01
15c3882a520dbb
hex60466952ca29

105855531010601 has 2 divisors, whose sum is σ = 105855531010602. Its totient is φ = 105855531010600.

The previous prime is 105855531010589. The next prime is 105855531010609. The reversal of 105855531010601 is 106010135558501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 102817551730201 + 3037979280400 = 10139899^2 + 1742980^2 .

It is a cyclic number.

It is not a de Polignac number, because 105855531010601 - 210 = 105855531009577 is a prime.

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

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

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

Almost surely, 2105855531010601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 90000, while the sum is 41.

The spelling of 105855531010601 in words is "one hundred five trillion, eight hundred fifty-five billion, five hundred thirty-one million, ten thousand, six hundred one".