Search a number
-
+
115251151369 is a prime number
BaseRepresentation
bin110101101010110000…
…0010000001000001001
3102000111001101002211211
41223111200100020021
53342013243320434
6124540132053121
711220013423444
oct1532540201011
9360431332754
10115251151369
11449722a7932
121a4054641a1
13ab393b2273
14581478065b
152ee810e464
hex1ad5810209

115251151369 has 2 divisors, whose sum is σ = 115251151370. Its totient is φ = 115251151368.

The previous prime is 115251151291. The next prime is 115251151391. The reversal of 115251151369 is 963151152511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 115167245769 + 83905600 = 339363^2 + 9160^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 2115251151369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 40500, while the sum is 40.

The spelling of 115251151369 in words is "one hundred fifteen billion, two hundred fifty-one million, one hundred fifty-one thousand, three hundred sixty-nine".