Search a number
-
+
13104010061 is a prime number
BaseRepresentation
bin11000011010000111…
…10101001101001101
31020211020111200102222
430031003311031031
5203314111310221
610004144225125
7642505150652
oct141503651515
936736450388
1013104010061
11561496578a
12265860b1a5
13130aaba80c
148c44c1c29
1551a6499ab
hex30d0f534d

13104010061 has 2 divisors, whose sum is σ = 13104010062. Its totient is φ = 13104010060.

The previous prime is 13104010019. The next prime is 13104010063. The reversal of 13104010061 is 16001040131.

13104010061 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., 11816994436 + 1287015625 = 108706^2 + 35875^2 .

It is a cyclic number.

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

Together with 13104010063, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 213104010061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72, while the sum is 17.

Adding to 13104010061 its reverse (16001040131), we get a palindrome (29105050192).

The spelling of 13104010061 in words is "thirteen billion, one hundred four million, ten thousand, sixty-one".