Search a number
-
+
152464111507 is a prime number
BaseRepresentation
bin1000110111111110010…
…0011011011110010011
3112120112111010100101201
42031333210123132103
54444221303032012
6154012511012031
714005126364551
oct2157744333623
9476474110351
10152464111507
115972901a644
122566bb0a017
13114b9c245c6
147544b3cbd1
153e750bb857
hex237f91b793

152464111507 has 2 divisors, whose sum is σ = 152464111508. Its totient is φ = 152464111506.

The previous prime is 152464111493. The next prime is 152464111511. The reversal of 152464111507 is 705111464251.

It is a strong prime.

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

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 2152464111507 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 33600, while the sum is 37.

Adding to 152464111507 its reverse (705111464251), we get a palindrome (857575575758).

The spelling of 152464111507 in words is "one hundred fifty-two billion, four hundred sixty-four million, one hundred eleven thousand, five hundred seven".