Search a number
-
+
13302110113 is a prime number
BaseRepresentation
bin11000110001101111…
…00001011110100001
31021100001021012121221
430120313201132201
5204220320010423
610035542215041
7650432033065
oct143067413641
937301235557
1013302110113
115706770236
1226b2a24481
13133cb5b096
1490292baa5
1552cc2ae5d
hex318de17a1

13302110113 has 2 divisors, whose sum is σ = 13302110114. Its totient is φ = 13302110112.

The previous prime is 13302110027. The next prime is 13302110117. The reversal of 13302110113 is 31101120331.

13302110113 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., 13222240144 + 79869969 = 114988^2 + 8937^2 .

It is a cyclic number.

It is not a de Polignac number, because 13302110113 - 233 = 4712175521 is a prime.

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

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

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

Almost surely, 213302110113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 16.

Adding to 13302110113 its reverse (31101120331), we get a palindrome (44403230444).

The spelling of 13302110113 in words is "thirteen billion, three hundred two million, one hundred ten thousand, one hundred thirteen".