Search a number
-
+
1050016141 is a prime number
BaseRepresentation
bin111110100101011…
…111100110001101
32201011210100100201
4332211133212031
54122301004031
6252105253501
735006663356
oct7645374615
92634710321
101050016141
11499785739
12253794291
131396cca35
149d64ad2d
15622b0d61
hex3e95f98d

1050016141 has 2 divisors, whose sum is σ = 1050016142. Its totient is φ = 1050016140.

The previous prime is 1050016139. The next prime is 1050016199. The reversal of 1050016141 is 1416100501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 903242916 + 146773225 = 30054^2 + 12115^2 .

It is a cyclic number.

It is not a de Polignac number, because 1050016141 - 21 = 1050016139 is a prime.

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

Together with 1050016139, it forms a pair of twin primes.

It is a congruent number.

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

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

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

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

Almost surely, 21050016141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 120, while the sum is 19.

The square root of 1050016141 is about 32403.9525521193. The cubic root of 1050016141 is about 1016.4015649322.

Adding to 1050016141 its reverse (1416100501), we get a palindrome (2466116642).

The spelling of 1050016141 in words is "one billion, fifty million, sixteen thousand, one hundred forty-one".