Search a number
-
+
154644350410051 is a prime number
BaseRepresentation
bin100011001010010111110001…
…100100101001110101000011
3202021112212002200010211000121
4203022113301210221311003
5130232143112201110201
61304522344523401111
744400454110654535
oct4312276144516503
9667485080124017
10154644350410051
1145302334266977
1215417140083197
136839b90763818
142a28b7dc97855
1512d29c3b2e9a1
hex8ca5f1929d43

154644350410051 has 2 divisors, whose sum is σ = 154644350410052. Its totient is φ = 154644350410050.

The previous prime is 154644350409947. The next prime is 154644350410057. The reversal of 154644350410051 is 150014053446451.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 154644350410051 - 29 = 154644350409539 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (154644350410057) 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, 77322175205025 + 77322175205026.

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

Almost surely, 2154644350410051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 576000, while the sum is 43.

The spelling of 154644350410051 in words is "one hundred fifty-four trillion, six hundred forty-four billion, three hundred fifty million, four hundred ten thousand, fifty-one".