Search a number
-
+
13053462997 is a prime number
BaseRepresentation
bin11000010100000110…
…00000100111010101
31020200201101121220111
430022003000213111
5203213141303442
65555141003021
7641322414301
oct141203004725
936621347814
1013053462997
115599380a53
1226436b3471
1313004a0403
148bb8c4d01
15515eb2b17
hex30a0c09d5

13053462997 has 2 divisors, whose sum is σ = 13053462998. Its totient is φ = 13053462996.

The previous prime is 13053462979. The next prime is 13053463021. The reversal of 13053462997 is 79926435031.

Together with previous prime (13053462979) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11463128356 + 1590334641 = 107066^2 + 39879^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 13053462997.

It is a congruent number.

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

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

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

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

Almost surely, 213053462997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1224720, while the sum is 49.

The spelling of 13053462997 in words is "thirteen billion, fifty-three million, four hundred sixty-two thousand, nine hundred ninety-seven".