Search a number
-
+
13145253053 is a prime number
BaseRepresentation
bin11000011111000010…
…01010010010111101
31020221010010001012012
430033201022102331
5203410141044203
610012220221005
7643515543632
oct141741122275
936833101165
1013145253053
1156361751a9
12266a39a765
1313164cb05a
148c9b7a189
1551e094bd8
hex30f84a4bd

13145253053 has 2 divisors, whose sum is σ = 13145253054. Its totient is φ = 13145253052.

The previous prime is 13145253031. The next prime is 13145253071. The reversal of 13145253053 is 35035254131.

13145253053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11675450809 + 1469802244 = 108053^2 + 38338^2 .

It is a cyclic number.

It is not a de Polignac number, because 13145253053 - 28 = 13145252797 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (13145253073) 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, 6572626526 + 6572626527.

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

Almost surely, 213145253053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 32.

The spelling of 13145253053 in words is "thirteen billion, one hundred forty-five million, two hundred fifty-three thousand, fifty-three".