Search a number
-
+
1070987267113 is a prime number
BaseRepresentation
bin11111001010110111101…
…00001100110000101001
310210101101221111020020021
433211123310030300221
5120021340220021423
62140001010000441
7140243030365321
oct17453364146051
93711357436207
101070987267113
113832264343a5
12153693576121
1379cbc1128ca
1439b9c214281
151ccd389095d
hexf95bd0cc29

1070987267113 has 2 divisors, whose sum is σ = 1070987267114. Its totient is φ = 1070987267112.

The previous prime is 1070987267057. The next prime is 1070987267123. The reversal of 1070987267113 is 3117627890701.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 653660931049 + 417326336064 = 808493^2 + 646008^2 .

It is an emirp because it is prime and its reverse (3117627890701) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1070987267113 - 225 = 1070953712681 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (1070987267123) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 535493633556 + 535493633557.

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

Almost surely, 21070987267113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 889056, while the sum is 52.

The spelling of 1070987267113 in words is "one trillion, seventy billion, nine hundred eighty-seven million, two hundred sixty-seven thousand, one hundred thirteen".