Search a number
-
+
541335325301 is a prime number
BaseRepresentation
bin1111110000010100001…
…10011000101001110101
31220202021120220210200122
413320022012120221311
532332123320402201
61052404102421325
754052536226001
oct7701206305165
91822246823618
10541335325301
11199640751171
1288ab8131845
133c080a56144
141c2b4ca9701
15e134986e1b
hex7e0a198a75

541335325301 has 2 divisors, whose sum is σ = 541335325302. Its totient is φ = 541335325300.

The previous prime is 541335325183. The next prime is 541335325303. The reversal of 541335325301 is 103523533145.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 536629502500 + 4705822801 = 732550^2 + 68599^2 .

It is a cyclic number.

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

Together with 541335325303, 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 (541335325303) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2541335325301 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 81000, while the sum is 35.

Adding to 541335325301 its reverse (103523533145), we get a palindrome (644858858446).

The spelling of 541335325301 in words is "five hundred forty-one billion, three hundred thirty-five million, three hundred twenty-five thousand, three hundred one".