Search a number
-
+
10000001010071 is a prime number
BaseRepresentation
bin1001000110000100111010…
…0000100000100110010111
31022101222202021010120101102
42101201032200200212113
52302320000224310241
633133534222420315
72051322230052152
oct221411640404627
938358667116342
1010000001010071
113205a81963996
12115609813169b
13576cc44201b7
14268007312c99
151251ca09239b
hex9184e820997

10000001010071 has 2 divisors, whose sum is σ = 10000001010072. Its totient is φ = 10000001010070.

The previous prime is 10000001010011. The next prime is 10000001010107. The reversal of 10000001010071 is 17001010000001.

Together with next prime (10000001010107) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10000001010071 - 230 = 9998927268247 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 210000001010071 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7, while the sum is 11.

Adding to 10000001010071 its reverse (17001010000001), we get a palindrome (27001011010072).

The spelling of 10000001010071 in words is "ten trillion, one million, ten thousand, seventy-one".