Search a number
-
+
13366601293 is a prime number
BaseRepresentation
bin11000111001011011…
…00010011001001101
31021111112121200220011
430130231202121031
5204333322220133
610050204353221
7652144144033
oct143455423115
937445550804
1013366601293
11573a109431
122710545811
13135031b346
1490b318553
155337196cd
hex31cb6264d

13366601293 has 2 divisors, whose sum is σ = 13366601294. Its totient is φ = 13366601292.

The previous prime is 13366601273. The next prime is 13366601329. The reversal of 13366601293 is 39210666331.

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

Together with next prime (13366601329) 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., 13363822404 + 2778889 = 115602^2 + 1667^2 .

It is a cyclic number.

It is not a de Polignac number, because 13366601293 - 29 = 13366600781 is a prime.

It is a congruent number.

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

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

Almost surely, 213366601293 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 104976, while the sum is 40.

The spelling of 13366601293 in words is "thirteen billion, three hundred sixty-six million, six hundred one thousand, two hundred ninety-three".