Search a number
-
+
114853408757 is a prime number
BaseRepresentation
bin110101011110111001…
…0111110111111110101
3101222110022221200112222
41222331302332333311
53340204433040012
6124432443052125
711204113603133
oct1527562767765
9358408850488
10114853408757
1144788833a2a
121a314211045
13aaa4b812c9
1457b7a06753
152ec3244972
hex1abdcbeff5

114853408757 has 2 divisors, whose sum is σ = 114853408758. Its totient is φ = 114853408756.

The previous prime is 114853408729. The next prime is 114853408783. The reversal of 114853408757 is 757804358411.

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., 114626936356 + 226472401 = 338566^2 + 15049^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 114853408757 - 218 = 114853146613 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 114853408699 and 114853408708.

It is a congruent number.

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

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

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

Almost surely, 2114853408757 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3763200, while the sum is 53.

The spelling of 114853408757 in words is "one hundred fourteen billion, eight hundred fifty-three million, four hundred eight thousand, seven hundred fifty-seven".