Search a number
-
+
1053020204501 is a prime number
BaseRepresentation
bin11110101001011001110…
…01010010110111010101
310201200000210021212210212
433110230321102313111
5114223041133021001
62123430101255205
7136035552024506
oct17245471226725
93650023255725
101053020204501
113766464a9321
121500ba404505
13783b7975305
1438d75d1cbad
151c5d13417bb
hexf52ce52dd5

1053020204501 has 2 divisors, whose sum is σ = 1053020204502. Its totient is φ = 1053020204500.

The previous prime is 1053020204497. The next prime is 1053020204521. The reversal of 1053020204501 is 1054020203501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 875104120900 + 177916083601 = 935470^2 + 421801^2 .

It is a cyclic number.

It is not a de Polignac number, because 1053020204501 - 22 = 1053020204497 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21053020204501 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1200, while the sum is 23.

It can be divided in two parts, 1053020 and 204501, that added together give a palindrome (1257521).

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