Search a number
-
+
152746235753 is a prime number
BaseRepresentation
bin1000111001000001100…
…0101001011101101001
3112121021010222202002212
42032100120221131221
510000311014021003
6154100505534505
714015123403326
oct2162030513551
9477233882085
10152746235753
11598632a4781
122572a4a4435
1311533503b27
1475703bbb4d
153e8ec48dd8
hex2390629769

152746235753 has 2 divisors, whose sum is σ = 152746235754. Its totient is φ = 152746235752.

The previous prime is 152746235701. The next prime is 152746235783. The reversal of 152746235753 is 357532647251.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 152730892864 + 15342889 = 390808^2 + 3917^2 .

It is a cyclic number.

It is not a de Polignac number, because 152746235753 - 28 = 152746235497 is a prime.

It is a super-2 number, since 2×1527462357532 (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 (152746235783) 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, 76373117876 + 76373117877.

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

Almost surely, 2152746235753 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5292000, while the sum is 50.

The spelling of 152746235753 in words is "one hundred fifty-two billion, seven hundred forty-six million, two hundred thirty-five thousand, seven hundred fifty-three".