Search a number
-
+
1054911157 is a prime number
BaseRepresentation
bin111110111000001…
…010101010110101
32201112000001001121
4332320022222311
54130024124112
6252402223541
735066411506
oct7670125265
92645001047
101054911157
114a1519403
12255354bb1
1313a724ab1
14a0162bad
156292b407
hex3ee0aab5

1054911157 has 2 divisors, whose sum is σ = 1054911158. Its totient is φ = 1054911156.

The previous prime is 1054911133. The next prime is 1054911191. The reversal of 1054911157 is 7511194501.

It is an a-pointer prime, because the next prime (1054911191) can be obtained adding 1054911157 to its sum of digits (34).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1019461041 + 35450116 = 31929^2 + 5954^2 .

It is a cyclic number.

It is not a de Polignac number, because 1054911157 - 223 = 1046522549 is a prime.

It is a super-2 number, since 2×10549111572 = 2225675098326157298, which contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 21054911157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6300, while the sum is 34.

The square root of 1054911157 is about 32479.3958841602. The cubic root of 1054911157 is about 1017.9785535525.

The spelling of 1054911157 in words is "one billion, fifty-four million, nine hundred eleven thousand, one hundred fifty-seven".