Search a number
-
+
1094583915361 is a prime number
BaseRepresentation
bin11111110110110100100…
…10010001001101100001
310212122022102202011100101
433323122102101031201
5120413201440242421
62154502300022401
7142036544524216
oct17733222211541
93778272664311
101094583915361
113922350a2492
12158179b31a01
137c2ac995b71
143ad9a055b0d
151d71525a191
hexfeda491361

1094583915361 has 2 divisors, whose sum is σ = 1094583915362. Its totient is φ = 1094583915360.

The previous prime is 1094583915319. The next prime is 1094583915367. The reversal of 1094583915361 is 1635193854901.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 749339534736 + 345244380625 = 865644^2 + 587575^2 .

It is a cyclic number.

It is not a de Polignac number, because 1094583915361 - 27 = 1094583915233 is a prime.

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

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

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

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

Almost surely, 21094583915361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3499200, while the sum is 55.

The spelling of 1094583915361 in words is "one trillion, ninety-four billion, five hundred eighty-three million, nine hundred fifteen thousand, three hundred sixty-one".