Search a number
-
+
133010300513 is a prime number
BaseRepresentation
bin111101111100000001…
…0000001111001100001
3110201022201100100121102
41323320002001321201
54134401114104023
6141034252204145
712416055620456
oct1737002017141
9421281310542
10133010300513
11514559354a2
1221940a69655
13c70975463c
14661b1d382d
1536d728e628
hex1ef8081e61

133010300513 has 2 divisors, whose sum is σ = 133010300514. Its totient is φ = 133010300512.

The previous prime is 133010300509. The next prime is 133010300531. The reversal of 133010300513 is 315003010331.

Together with next prime (133010300531) 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., 88484236369 + 44526064144 = 297463^2 + 211012^2 .

It is a cyclic number.

It is not a de Polignac number, because 133010300513 - 22 = 133010300509 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 2133010300513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 405, while the sum is 20.

Adding to 133010300513 its reverse (315003010331), we get a palindrome (448013310844).

The spelling of 133010300513 in words is "one hundred thirty-three billion, ten million, three hundred thousand, five hundred thirteen".