Search a number
-
+
105553011403153 is a prime number
BaseRepresentation
bin10111111111111111111001…
…101111111110100110010001
3111211201202202211221200002101
4113333333321233332212101
5102313340031404400103
61012254214540520401
731142645010234616
oct2777777157764621
9454652684850071
10105553011403153
11306a58651a2a16
12ba08a69b50101
1346b87b5c72642
141c0cb1604250d
15c30a21a61a1d
hex5ffff9bfe991

105553011403153 has 2 divisors, whose sum is σ = 105553011403154. Its totient is φ = 105553011403152.

The previous prime is 105553011403087. The next prime is 105553011403163. The reversal of 105553011403153 is 351304110355501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105200879535504 + 352131867649 = 10256748^2 + 593407^2 .

It is a cyclic number.

It is not a de Polignac number, because 105553011403153 - 221 = 105553009306001 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (105553011403163) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52776505701576 + 52776505701577.

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

Almost surely, 2105553011403153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 67500, while the sum is 37.

Adding to 105553011403153 its reverse (351304110355501), we get a palindrome (456857121758654).

The spelling of 105553011403153 in words is "one hundred five trillion, five hundred fifty-three billion, eleven million, four hundred three thousand, one hundred fifty-three".