Search a number
-
+
115141972567 is a prime number
BaseRepresentation
bin110101100111011111…
…1110001001001010111
3102000012102221020200111
41223032333301021113
53341302321110232
6124521232023451
711214216422056
oct1531677611127
9360172836614
10115141972567
1144916707216
121a394991b87
13ab1c8a691b
14580408039d
152edd745047
hex1aceff1257

115141972567 has 2 divisors, whose sum is σ = 115141972568. Its totient is φ = 115141972566.

The previous prime is 115141972529. The next prime is 115141972571. The reversal of 115141972567 is 765279141511.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 115141972567 - 215 = 115141939799 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2115141972567 is an apocalyptic number.

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

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

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

The product of its digits is 529200, while the sum is 49.

The spelling of 115141972567 in words is "one hundred fifteen billion, one hundred forty-one million, nine hundred seventy-two thousand, five hundred sixty-seven".