Search a number
-
+
1066166016613 is a prime number
BaseRepresentation
bin11111000001111000111…
…00100101101001100101
310202220221221110022212221
433200330130211221211
5114432002000012423
62133442341512341
7140012405420365
oct17407434455145
93686857408787
101066166016613
11381181a15555
12152768a126b1
137970130a969
1439861ba29a5
151cb00496e5d
hexf83c725a65

1066166016613 has 2 divisors, whose sum is σ = 1066166016614. Its totient is φ = 1066166016612.

The previous prime is 1066166016581. The next prime is 1066166016659. The reversal of 1066166016613 is 3166106616601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 998964268324 + 67201748289 = 999482^2 + 259233^2 .

It is an emirp because it is prime and its reverse (3166106616601) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1066166016613 - 25 = 1066166016581 is a prime.

It is a super-2 number, since 2×10661660166132 (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 1066166016613.

It is a congruent number.

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

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

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

Almost surely, 21066166016613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 139968, while the sum is 43.

The spelling of 1066166016613 in words is "one trillion, sixty-six billion, one hundred sixty-six million, sixteen thousand, six hundred thirteen".