Search a number
-
+
9476141 is a prime number
BaseRepresentation
bin100100001001…
…100000101101
3122211102211012
4210021200231
54411214031
6535035005
7143355143
oct44114055
918742735
109476141
115392624
12320ba65
131c6a2ac
141389593
15c72b2b
hex90982d

9476141 has 2 divisors, whose sum is σ = 9476142. Its totient is φ = 9476140.

The previous prime is 9476119. The next prime is 9476143. The reversal of 9476141 is 1416749.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9278116 + 198025 = 3046^2 + 445^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 9476141 - 210 = 9475117 is a prime.

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

It is a Chen prime.

It is an alternating number because its digits alternate between odd and even.

It is a junction number, because it is equal to n+sod(n) for n = 9476098 and 9476107.

It is a congruent number.

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

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

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

Almost surely, 29476141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 6048, while the sum is 32.

The square root of 9476141 is about 3078.3341274137. The cubic root of 9476141 is about 211.6137279173.

The spelling of 9476141 in words is "nine million, four hundred seventy-six thousand, one hundred forty-one".