Search a number
-
+
13253150251093 is a prime number
BaseRepresentation
bin1100000011011011110101…
…0100000001100001010101
31201220222200211100201111011
43000312331110001201111
53214114422431013333
644104225125012221
72535336263260564
oct300667524014125
951828624321434
1013253150251093
11424a6a1898245
1215a0671254071
137519c75b7abc
1433b654d91bdb
1517eb28d239cd
hexc0dbd501855

13253150251093 has 2 divisors, whose sum is σ = 13253150251094. Its totient is φ = 13253150251092.

The previous prime is 13253150251069. The next prime is 13253150251151. The reversal of 13253150251093 is 39015205135231.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8352602867569 + 4900547383524 = 2890087^2 + 2213718^2 .

It is a cyclic number.

It is not a de Polignac number, because 13253150251093 - 213 = 13253150242901 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 213253150251093 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 13253150251093 in words is "thirteen trillion, two hundred fifty-three billion, one hundred fifty million, two hundred fifty-one thousand, ninety-three".