Search a number
-
+
1360570011041 is a prime number
BaseRepresentation
bin10011110011001000010…
…010101100110110100001
311211001212110111211010102
4103303020102230312201
5134242421410323131
62521012013112145
7200204123164013
oct23631022546641
94731773454112
101360570011041
11485018334a5a
1219b830188655
139b3bb980267
1449bcda1a1b3
15255d17201cb
hex13cc84acda1

1360570011041 has 2 divisors, whose sum is σ = 1360570011042. Its totient is φ = 1360570011040.

The previous prime is 1360570011001. The next prime is 1360570011077. The reversal of 1360570011041 is 1401100750631.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1302394500625 + 58175510416 = 1141225^2 + 241196^2 .

It is a cyclic number.

It is not a de Polignac number, because 1360570011041 - 230 = 1359496269217 is a prime.

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

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

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

Almost surely, 21360570011041 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 29.

Adding to 1360570011041 its reverse (1401100750631), we get a palindrome (2761670761672).

The spelling of 1360570011041 in words is "one trillion, three hundred sixty billion, five hundred seventy million, eleven thousand, forty-one".