Search a number
-
+
131103312020053 is a prime number
BaseRepresentation
bin11101110011110011011110…
…010101111000001001010101
3122012012100120020020002212221
4131303303132111320021111
5114140444040334120203
61142500010255342341
736420621201143242
oct3563633625701125
9565170506202787
10131103312020053
113885666986297a
1212854849b219b1
13581ccb2590929
1424536114905c9
151025470bc3abd
hex773cde578255

131103312020053 has 2 divisors, whose sum is σ = 131103312020054. Its totient is φ = 131103312020052.

The previous prime is 131103312019993. The next prime is 131103312020123. The reversal of 131103312020053 is 350020213301131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 130960169351089 + 143142668964 = 11443783^2 + 378342^2 .

It is an emirp because it is prime and its reverse (350020213301131) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-131103312020053 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2131103312020053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1620, while the sum is 25.

Adding to 131103312020053 its reverse (350020213301131), we get a palindrome (481123525321184).

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