Search a number
-
+
133032113203061 is a prime number
BaseRepresentation
bin11110001111110111110011…
…110110011110011101110101
3122110000202010200221022020002
4132033313303312132131311
5114414044231434444221
61150534035322521045
740010152531531352
oct3617676366363565
9573022120838202
10133032113203061
113942a669843746
1212b06621666185
13592cb4a20b797
1424bcb08025629
15105a70d1da80b
hex78fdf3d9e775

133032113203061 has 2 divisors, whose sum is σ = 133032113203062. Its totient is φ = 133032113203060.

The previous prime is 133032113203009. The next prime is 133032113203069. The reversal of 133032113203061 is 160302311230331.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105981774615025 + 27050338588036 = 10294745^2 + 5200994^2 .

It is a cyclic number.

It is not a de Polignac number, because 133032113203061 - 26 = 133032113202997 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (133032113203069) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66516056601530 + 66516056601531.

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

Almost surely, 2133032113203061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5832, while the sum is 29.

Adding to 133032113203061 its reverse (160302311230331), we get a palindrome (293334424433392).

The spelling of 133032113203061 in words is "one hundred thirty-three trillion, thirty-two billion, one hundred thirteen million, two hundred three thousand, sixty-one".