Search a number
-
+
1071966924013 is a prime number
BaseRepresentation
bin11111001100101100011…
…01010010110011101101
310210110221012212221212011
433212112031102303231
5120030342013032023
62140242123241221
7140306224341016
oct17462615226355
93713835787764
101071966924013
113836894230a7
12153907679211
137a11707944b
1439c5238800d
151cd3e8a450d
hexf996352ced

1071966924013 has 2 divisors, whose sum is σ = 1071966924014. Its totient is φ = 1071966924012.

The previous prime is 1071966923987. The next prime is 1071966924047. The reversal of 1071966924013 is 3104296691701.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 896093210884 + 175873713129 = 946622^2 + 419373^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1071966924013 is a prime.

It is a super-2 number, since 2×10719669240132 (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 (1071966924313) 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, 535983462006 + 535983462007.

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

Almost surely, 21071966924013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 489888, while the sum is 49.

The spelling of 1071966924013 in words is "one trillion, seventy-one billion, nine hundred sixty-six million, nine hundred twenty-four thousand, thirteen".