Search a number
-
+
1120805056337 is a prime number
BaseRepresentation
bin10000010011110101001…
…011111110111101010001
310222010222211110010122212
4100103311023332331101
5121330402043300322
62214520222041505
7143655410534321
oct20236513767521
93863884403585
101120805056337
113a237026482a
12161277419295
13818cb1b63b5
143c366673281
151e24c2420e2
hex104f52fef51

1120805056337 has 2 divisors, whose sum is σ = 1120805056338. Its totient is φ = 1120805056336.

The previous prime is 1120805056307. The next prime is 1120805056361. The reversal of 1120805056337 is 7336505080211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 675093932881 + 445711123456 = 821641^2 + 667616^2 .

It is a cyclic number.

It is not a de Polignac number, because 1120805056337 - 210 = 1120805055313 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1120805056294 and 1120805056303.

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

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

Almost surely, 21120805056337 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 151200, while the sum is 41.

The spelling of 1120805056337 in words is "one trillion, one hundred twenty billion, eight hundred five million, fifty-six thousand, three hundred thirty-seven".