Search a number
-
+
1067068215713 is a prime number
BaseRepresentation
bin11111000011100100011…
…10001101000110100001
310210000021211002210101102
433201302032031012201
5114440323430400323
62134112051044145
7140043642115433
oct17416216150641
93700254083342
101067068215713
113815a520a045
1215297aba0655
13798161c4296
1439909932653
151cb547aa328
hexf87238d1a1

1067068215713 has 2 divisors, whose sum is σ = 1067068215714. Its totient is φ = 1067068215712.

The previous prime is 1067068215691. The next prime is 1067068215737. The reversal of 1067068215713 is 3175128607601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1058991239329 + 8076976384 = 1029073^2 + 89872^2 .

It is a cyclic number.

It is not a de Polignac number, because 1067068215713 - 220 = 1067067167137 is a prime.

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

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

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

Almost surely, 21067068215713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 423360, while the sum is 47.

The spelling of 1067068215713 in words is "one trillion, sixty-seven billion, sixty-eight million, two hundred fifteen thousand, seven hundred thirteen".