Search a number
-
+
1068182590609 is a prime number
BaseRepresentation
bin11111000101101001010…
…01001101010010010001
310210010011110222220100201
433202310221031102101
5120000114220344414
62134414420015201
7140113363132021
oct17426451152221
93703143886321
101068182590609
11382017252432
12153030231501
1379963038c04
14399b3933a81
151cbbc530574
hexf8b4a4d491

1068182590609 has 2 divisors, whose sum is σ = 1068182590610. Its totient is φ = 1068182590608.

The previous prime is 1068182590543. The next prime is 1068182590747. The reversal of 1068182590609 is 9060952818601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 785421337600 + 282761253009 = 886240^2 + 531753^2 .

It is a cyclic number.

It is not a de Polignac number, because 1068182590609 - 27 = 1068182590481 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 1068182590609.

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

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

Almost surely, 21068182590609 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1068182590609 in words is "one trillion, sixty-eight billion, one hundred eighty-two million, five hundred ninety thousand, six hundred nine".