Search a number
-
+
1063151 is a prime number
BaseRepresentation
bin100000011100011101111
32000000100222
410003203233
5233010101
634441555
712015365
oct4034357
92000328
101063151
11666841
124332bb
132b2bab
141d9635
1516001b
hex1038ef

1063151 has 2 divisors, whose sum is σ = 1063152. Its totient is φ = 1063150.

The previous prime is 1063123. The next prime is 1063157. The reversal of 1063151 is 1513601.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1063151 - 26 = 1063087 is a prime.

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

It is a Sophie Germain prime.

It is a congruent number.

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

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

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

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

21063151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 90, while the sum is 17.

The square root of 1063151 is about 1031.0921394327. The cubic root of 1063151 is about 102.0622137438.

Adding to 1063151 its reverse (1513601), we get a palindrome (2576752).

The spelling of 1063151 in words is "one million, sixty-three thousand, one hundred fifty-one".