Search a number
-
+
13649752997 is a prime number
BaseRepresentation
bin11001011011001011…
…01011001110100101
31022020021102022000022
430231211223032211
5210423314043442
610134241324525
7662152662146
oct145545531645
938207368008
1013649752997
115874a25501
12278b336745
131396b9a42a
14936b83acd
1554d4eb3d2
hex32d96b3a5

13649752997 has 2 divisors, whose sum is σ = 13649752998. Its totient is φ = 13649752996.

The previous prime is 13649752933. The next prime is 13649753011. The reversal of 13649752997 is 79925794631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7994863396 + 5654889601 = 89414^2 + 75199^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 13649752997 - 26 = 13649752933 is a prime.

It is a super-2 number, since 2×136497529972 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 213649752997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 25719120, while the sum is 62.

The spelling of 13649752997 in words is "thirteen billion, six hundred forty-nine million, seven hundred fifty-two thousand, nine hundred ninety-seven".