Search a number
-
+
1050011147 is a prime number
BaseRepresentation
bin111110100101011…
…110011000001011
32201011210002111202
4332211132120023
54122300324042
6252105214415
735006642663
oct7645363013
92634702452
101050011147
11499781a09
1225379140b
131396ca693
149d6491a3
15622ae632
hex3e95e60b

1050011147 has 2 divisors, whose sum is σ = 1050011148. Its totient is φ = 1050011146.

The previous prime is 1050011101. The next prime is 1050011153. The reversal of 1050011147 is 7411100501.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1050011147 is a prime.

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

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

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

Almost surely, 21050011147 is an apocalyptic number.

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

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

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

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

The square root of 1050011147 is about 32403.8754935270. The cubic root of 1050011147 is about 1016.3999535546.

Adding to 1050011147 its reverse (7411100501), we get a palindrome (8461111648).

The spelling of 1050011147 in words is "one billion, fifty million, eleven thousand, one hundred forty-seven".