Search a number
-
+
1053353530129 is a prime number
BaseRepresentation
bin11110101010000001100…
…00110101001100010001
310201200220000111120121111
433111000300311030101
5114224232000431004
62123523125453321
7136050040163365
oct17250060651421
93650800446544
101053353530129
113767a767484a
12150191b71241
137843ba40a04
1438da82c92a5
151c600734a04
hexf540c35311

1053353530129 has 2 divisors, whose sum is σ = 1053353530130. Its totient is φ = 1053353530128.

The previous prime is 1053353530049. The next prime is 1053353530157. The reversal of 1053353530129 is 9210353533501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 793431999504 + 259921530625 = 890748^2 + 509825^2 .

It is a cyclic number.

It is not a de Polignac number, because 1053353530129 - 29 = 1053353529617 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 1053353530091 and 1053353530100.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21053353530129 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 182250, while the sum is 40.

The spelling of 1053353530129 in words is "one trillion, fifty-three billion, three hundred fifty-three million, five hundred thirty thousand, one hundred twenty-nine".