Search a number
-
+
114314550229153 is a prime number
BaseRepresentation
bin11001111111011111101110…
…001010001011100010100001
3112222202100211112222201212101
4121333133232022023202201
5104440412144324313103
61043043213540530401
733035645056411441
oct3177375612134241
9488670745881771
10114314550229153
113347358a48062a
12109a2b136b0a01
134ba2a7b4c8231
142032bd49a8121
15d338b544aa1d
hex67f7ee28b8a1

114314550229153 has 2 divisors, whose sum is σ = 114314550229154. Its totient is φ = 114314550229152.

The previous prime is 114314550229133. The next prime is 114314550229163. The reversal of 114314550229153 is 351922055413411.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 98970901321744 + 15343648907409 = 9948412^2 + 3917097^2 .

It is a cyclic number.

It is not a de Polignac number, because 114314550229153 - 213 = 114314550220961 is a prime.

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

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

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

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

Almost surely, 2114314550229153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 648000, while the sum is 46.

The spelling of 114314550229153 in words is "one hundred fourteen trillion, three hundred fourteen billion, five hundred fifty million, two hundred twenty-nine thousand, one hundred fifty-three".