Search a number
-
+
10006894171 is a prime number
BaseRepresentation
bin10010101000111010…
…10001011001011011
3221211101201220011001
421110131101121123
5130443231103141
64332550245431
7502660124401
oct112435213133
927741656131
1010006894171
1142756a377a
121b33356877
13c36262471
146ad039471
153d87c0a31
hex25475165b

10006894171 has 2 divisors, whose sum is σ = 10006894172. Its totient is φ = 10006894170.

The previous prime is 10006894169. The next prime is 10006894181. The reversal of 10006894171 is 17149860001.

10006894171 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10006894171 - 21 = 10006894169 is a prime.

Together with 10006894169, it forms a pair of twin primes.

It is a self number, because there is not a number n which added to its sum of digits gives 10006894171.

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

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

Almost surely, 210006894171 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 12096, while the sum is 37.

The spelling of 10006894171 in words is "ten billion, six million, eight hundred ninety-four thousand, one hundred seventy-one".