Search a number
-
+
152761103393 is a prime number
BaseRepresentation
bin1000111001000101000…
…1010111010000100001
3112121022011222002200012
42032101101113100201
510000323320302033
6154102200334305
714015363645243
oct2162121272041
9477264862605
10152761103393
1159870729a88
1225733474395
131153660b152
14757236c093
153e911d4248
hex2391457421

152761103393 has 2 divisors, whose sum is σ = 152761103394. Its totient is φ = 152761103392.

The previous prime is 152761103377. The next prime is 152761103441. The reversal of 152761103393 is 393301167251.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 141926999824 + 10834103569 = 376732^2 + 104087^2 .

It is an emirp because it is prime and its reverse (393301167251) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 152761103393 - 24 = 152761103377 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 152761103393.

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

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

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

Almost surely, 2152761103393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 102060, while the sum is 41.

The spelling of 152761103393 in words is "one hundred fifty-two billion, seven hundred sixty-one million, one hundred three thousand, three hundred ninety-three".