Search a number
-
+
53050005269 is a prime number
BaseRepresentation
bin110001011010000001…
…101101011100010101
312001221010221111021222
4301122001231130111
51332121300132034
640212033420125
73555425414252
oct613201553425
9161833844258
1053050005269
1120553388168
12a34640a645
135005911b81
1427d3832429
1515a751512e
hexc5a06d715

53050005269 has 2 divisors, whose sum is σ = 53050005270. Its totient is φ = 53050005268.

The previous prime is 53050005257. The next prime is 53050005293. The reversal of 53050005269 is 96250005035.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 27883990225 + 25166015044 = 166985^2 + 158638^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 253050005269 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 53050005269 in words is "fifty-three billion, fifty million, five thousand, two hundred sixty-nine".