Search a number
-
+
1050575031221 is a prime number
BaseRepresentation
bin11110100100110110010…
…01101100101110110101
310201102201101021012122112
433102123021230232311
5114203034201444341
62122343312540405
7135621141265442
oct17223311545665
93642641235575
101050575031221
11375601242461
1214b737551705
13780b8201211
1438bc32a09c9
151c4db845aeb
hexf49b26cbb5

1050575031221 has 2 divisors, whose sum is σ = 1050575031222. Its totient is φ = 1050575031220.

The previous prime is 1050575031197. The next prime is 1050575031223. The reversal of 1050575031221 is 1221305750501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 969754227121 + 80820804100 = 984761^2 + 284290^2 .

It is a cyclic number.

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

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

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

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 21050575031221 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10500, while the sum is 32.

The spelling of 1050575031221 in words is "one trillion, fifty billion, five hundred seventy-five million, thirty-one thousand, two hundred twenty-one".