Search a number
-
+
115014701 is a prime number
BaseRepresentation
bin1101101101011…
…11110000101101
322000102100111202
412312233300231
5213420432301
615225055245
72564415554
oct666576055
9260370452
10115014701
1159a1727a
1232627525
131aa9ca49
14113bcd9b
15a16d66b
hex6dafc2d

115014701 has 2 divisors, whose sum is σ = 115014702. Its totient is φ = 115014700.

The previous prime is 115014643. The next prime is 115014709. The reversal of 115014701 is 107410511.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 65593801 + 49420900 = 8099^2 + 7030^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×1150147012 = 26456762892238802, which contains 22 as substring.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 2115014701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 140, while the sum is 20.

The square root of 115014701 is about 10724.4907105186. The cubic root of 115014701 is about 486.3151340067.

It can be divided in two parts, 1150 and 14701, that added together give a palindrome (15851).

The spelling of 115014701 in words is "one hundred fifteen million, fourteen thousand, seven hundred one".