Search a number
-
+
1416085099157 is a prime number
BaseRepresentation
bin10100100110110101001…
…111111101001010010101
312000101011101221111101002
4110212311033331022111
5141200120241133112
63002312430113045
7204210623511611
oct24466517751225
95011141844332
101416085099157
114a6616137373
121aa54404b785
13a36c81b7421
144c7789b0341
1526c803651c2
hex149b53fd295

1416085099157 has 2 divisors, whose sum is σ = 1416085099158. Its totient is φ = 1416085099156.

The previous prime is 1416085099049. The next prime is 1416085099189. The reversal of 1416085099157 is 7519905806141.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1399616766916 + 16468332241 = 1183054^2 + 128329^2 .

It is a cyclic number.

It is not a de Polignac number, because 1416085099157 - 222 = 1416080904853 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21416085099157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2721600, while the sum is 56.

The spelling of 1416085099157 in words is "one trillion, four hundred sixteen billion, eighty-five million, ninety-nine thousand, one hundred fifty-seven".