Search a number
-
+
1066151065073 is a prime number
BaseRepresentation
bin11111000001110111000…
…11100011010111110001
310202220220220022201020012
433200323203203113301
5114431434133040243
62133441045224305
7140012134346033
oct17407343432761
93686826281205
101066151065073
11381174533206
12152763a02095
13796cb1a43b3
143985dbcdc53
151caedee1d18
hexf83b8e35f1

1066151065073 has 2 divisors, whose sum is σ = 1066151065074. Its totient is φ = 1066151065072.

The previous prime is 1066151064997. The next prime is 1066151065117. The reversal of 1066151065073 is 3705601516601.

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., 651044038129 + 415107026944 = 806873^2 + 644288^2 .

It is a cyclic number.

It is not a de Polignac number, because 1066151065073 - 214 = 1066151048689 is a prime.

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

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

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

Almost surely, 21066151065073 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1066151065073 in words is "one trillion, sixty-six billion, one hundred fifty-one million, sixty-five thousand, seventy-three".