Search a number
-
+
1050750011161 is a prime number
BaseRepresentation
bin11110100101001011001…
…01001100011100011001
310201110011120112010000001
433102211211030130121
5114203414000324121
62122412523213001
7135625364505154
oct17224545143431
93643146463001
101050750011161
11375690a96484
1214b786077161
1378115538146
1438bdc60cc9b
151c4ebdab991
hexf4a594c719

1050750011161 has 2 divisors, whose sum is σ = 1050750011162. Its totient is φ = 1050750011160.

The previous prime is 1050750011141. The next prime is 1050750011219. The reversal of 1050750011161 is 1611100570501.

1050750011161 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1050739803136 + 10208025 = 1025056^2 + 3195^2 .

It is a cyclic number.

It is not a de Polignac number, because 1050750011161 - 27 = 1050750011033 is a prime.

It is a super-2 number, since 2×10507500111612 (a number of 25 digits) contains 22 as substring.

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

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

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

Almost surely, 21050750011161 is an apocalyptic number.

It is an amenable number.

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

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

1050750011161 is an evil number, because the sum of its binary digits is even.

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

Adding to 1050750011161 its reverse (1611100570501), we get a palindrome (2661850581662).

The spelling of 1050750011161 in words is "one trillion, fifty billion, seven hundred fifty million, eleven thousand, one hundred sixty-one".