Search a number
-
+
1150957 is a prime number
BaseRepresentation
bin100011000111111101101
32011110211001
410120333231
5243312312
640400301
712532363
oct4307755
92143731
101150957
11716805
12476091
13313b52
1421d633
1517b057
hex118fed

1150957 has 2 divisors, whose sum is σ = 1150958. Its totient is φ = 1150956.

The previous prime is 1150949. The next prime is 1150973. The reversal of 1150957 is 7590511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 594441 + 556516 = 771^2 + 746^2 .

It is a cyclic number.

It is not a de Polignac number, because 1150957 - 23 = 1150949 is a prime.

It is a congruent number.

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

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

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

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

21150957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1575, while the sum is 28.

The square root of 1150957 is about 1072.8266402360. The cubic root of 1150957 is about 104.7980092565.

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