Search a number
-
+
115431140567 is a prime number
BaseRepresentation
bin110101110000000111…
…0110110110011010111
3102000221121001111121102
41223200032312303113
53342400332444232
6125010041540315
711224330335341
oct1534016666327
9360847044542
10115431140567
1144a54962436
121a4557a469b
13ab67781252
145830634291
153008d14662
hex1ae03b6cd7

115431140567 has 2 divisors, whose sum is σ = 115431140568. Its totient is φ = 115431140566.

The previous prime is 115431140521. The next prime is 115431140579. The reversal of 115431140567 is 765041134511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 115431140567 - 226 = 115364031703 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2115431140567 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 50400, while the sum is 38.

The spelling of 115431140567 in words is "one hundred fifteen billion, four hundred thirty-one million, one hundred forty thousand, five hundred sixty-seven".