Search a number
-
+
1067271051401 is a prime number
BaseRepresentation
bin11111000011111100100…
…11111101100010001001
310210000210221202220122022
433201332103331202021
5114441232342121101
62134144134334225
7140051654153222
oct17417623754211
93700727686568
101067271051401
11381699759545
12152a16aba375
13798492321b9
1439928852249
151cb674c4a1b
hexf87e4fd889

1067271051401 has 2 divisors, whose sum is σ = 1067271051402. Its totient is φ = 1067271051400.

The previous prime is 1067271051307. The next prime is 1067271051437. The reversal of 1067271051401 is 1041501727601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 968187121225 + 99083930176 = 983965^2 + 314776^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 21067271051401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11760, while the sum is 35.

The spelling of 1067271051401 in words is "one trillion, sixty-seven billion, two hundred seventy-one million, fifty-one thousand, four hundred one".