Search a number
-
+
10145536131053 is a prime number
BaseRepresentation
bin1001001110100011000100…
…0100111011111111101101
31022220220101212010201200102
42103220301010323333231
52312211024222143203
633324443413240445
72064663562140341
oct223506104737755
938826355121612
1010145536131053
11326177471a384
12117a333633125
135879489719bb
14271091adb621
15128d96bbe888
hex93a3113bfed

10145536131053 has 2 divisors, whose sum is σ = 10145536131054. Its totient is φ = 10145536131052.

The previous prime is 10145536130993. The next prime is 10145536131097. The reversal of 10145536131053 is 35013163554101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7763150055049 + 2382386076004 = 2786243^2 + 1543498^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 210145536131053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 81000, while the sum is 38.

Adding to 10145536131053 its reverse (35013163554101), we get a palindrome (45158699685154).

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