Search a number
-
+
114152601151 is a prime number
BaseRepresentation
bin110101001010000000…
…1100111011000111111
3101220122111020222020201
41222110001213120333
53332241031214101
6124235130224331
711150544046231
oct1522401473077
9356574228221
10114152601151
1144459192896
121a1595850a7
13a9c291b454
14574c8dc251
152e81962e01
hex1a9406763f

114152601151 has 2 divisors, whose sum is σ = 114152601152. Its totient is φ = 114152601150.

The previous prime is 114152601127. The next prime is 114152601301. The reversal of 114152601151 is 151106251411.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 114152601151 - 25 = 114152601119 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2114152601151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1200, while the sum is 28.

Adding to 114152601151 its reverse (151106251411), we get a palindrome (265258852562).

The spelling of 114152601151 in words is "one hundred fourteen billion, one hundred fifty-two million, six hundred one thousand, one hundred fifty-one".