Search a number
-
+
1151057 is a prime number
BaseRepresentation
bin100011001000001010001
32011110221202
410121001101
5243313212
640400545
712532565
oct4310121
92143852
101151057
11716896
12476155
13313bcb
1421d6a5
1517b0c2
hex119051

1151057 has 2 divisors, whose sum is σ = 1151058. Its totient is φ = 1151056.

The previous prime is 1151047. The next prime is 1151063. The reversal of 1151057 is 7501511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 638401 + 512656 = 799^2 + 716^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1151057 - 24 = 1151041 is a prime.

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

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

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

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

21151057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 175, while the sum is 20.

The square root of 1151057 is about 1072.8732450760. The cubic root of 1151057 is about 104.8010442663.

Adding to 1151057 its reverse (7501511), we get a palindrome (8652568).

The spelling of 1151057 in words is "one million, one hundred fifty-one thousand, fifty-seven".