Search a number
-
+
133010442569 is a prime number
BaseRepresentation
bin111101111100000001…
…0100100100101001001
3110201022201121120110202
41323320002210211021
54134401133130234
6141034255221545
712416060051564
oct1737002444511
9421281546422
10133010442569
1151455a221a4
1221940b178b5
13c7097a41b4
14661b22d4db
1536d72bb77e
hex1ef80a4949

133010442569 has 2 divisors, whose sum is σ = 133010442570. Its totient is φ = 133010442568.

The previous prime is 133010442503. The next prime is 133010442581. The reversal of 133010442569 is 965244010331.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 118223882569 + 14786560000 = 343837^2 + 121600^2 .

It is a cyclic number.

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

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

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 (133010442589) 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, 66505221284 + 66505221285.

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

Almost surely, 2133010442569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 77760, while the sum is 38.

The spelling of 133010442569 in words is "one hundred thirty-three billion, ten million, four hundred forty-two thousand, five hundred sixty-nine".