Search a number
-
+
1066411415701 is a prime number
BaseRepresentation
bin11111000010010110001…
…00101101100010010101
310202221121001012220011001
433201023010231202111
5114433002310300301
62133522545343301
7140021445320542
oct17411304554225
93687531186131
101066411415701
11381298496515
12152817037b31
13797400cc118
1439886601bc9
151cb16cbcc01
hexf84b12d895

1066411415701 has 2 divisors, whose sum is σ = 1066411415702. Its totient is φ = 1066411415700.

The previous prime is 1066411415659. The next prime is 1066411415711. The reversal of 1066411415701 is 1075141146601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 624653122500 + 441758293201 = 790350^2 + 664649^2 .

It is a cyclic number.

It is not a de Polignac number, because 1066411415701 - 29 = 1066411415189 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21066411415701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20160, while the sum is 37.

The spelling of 1066411415701 in words is "one trillion, sixty-six billion, four hundred eleven million, four hundred fifteen thousand, seven hundred one".