Search a number
-
+
10147141 is a prime number
BaseRepresentation
bin100110101101…
…010101000101
3201002112021001
4212231111011
510044202031
61001253301
7152151334
oct46552505
921075231
1010147141
115800774
123494231
132143834
1414c1d1b
15d56861
hex9ad545

10147141 has 2 divisors, whose sum is σ = 10147142. Its totient is φ = 10147140.

The previous prime is 10147103. The next prime is 10147153. The reversal of 10147141 is 14174101.

10147141 is digitally balanced in base 2, 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., 10144225 + 2916 = 3185^2 + 54^2 .

It is a cyclic number.

It is not a de Polignac number, because 10147141 - 219 = 9622853 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 210147141 is an apocalyptic number.

It is an amenable number.

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

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

10147141 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 112, while the sum is 19.

The square root of 10147141 is about 3185.4577379083. The cubic root of 10147141 is about 216.4950138149.

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