Search a number
-
+
10147001 is a prime number
BaseRepresentation
bin100110101101…
…010010111001
3201002112001212
4212231102321
510044201001
61001252505
7152151044
oct46552271
921075055
1010147001
115800657
123494135
132143757
1414c1c5b
15d567bb
hex9ad4b9

10147001 has 2 divisors, whose sum is σ = 10147002. Its totient is φ = 10147000.

The previous prime is 10146959. The next prime is 10147003. The reversal of 10147001 is 10074101.

It is a happy number.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10086976 + 60025 = 3176^2 + 245^2 .

It is a cyclic number.

It is not a de Polignac number, because 10147001 - 26 = 10146937 is a prime.

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

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

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

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

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

Almost surely, 210147001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 28, while the sum is 14.

The square root of 10147001 is about 3185.4357629687. The cubic root of 10147001 is about 216.4940181505.

Subtracting from 10147001 its reverse (10074101), we obtain a square (72900 = 2702).

The spelling of 10147001 in words is "ten million, one hundred forty-seven thousand, one".