Search a number
-
+
84060941 is a prime number
BaseRepresentation
bin1010000001010…
…10101100001101
312212011201221012
411000222230031
5133004422231
612201415005
72040335426
oct500525415
9185151835
1084060941
11434a5258
122419a465
1314552903
14b24264d
1575a6e2b
hex502ab0d

84060941 has 2 divisors, whose sum is σ = 84060942. Its totient is φ = 84060940.

The previous prime is 84060917. The next prime is 84060973. The reversal of 84060941 is 14906048.

It is an a-pointer prime, because the next prime (84060973) can be obtained adding 84060941 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 83795716 + 265225 = 9154^2 + 515^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-84060941 is a prime.

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 284060941 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6912, while the sum is 32.

The square root of 84060941 is about 9168.4753912524. The cubic root of 84060941 is about 438.0577980203.

Adding to 84060941 its reverse (14906048), we get a palindrome (98966989).

The spelling of 84060941 in words is "eighty-four million, sixty thousand, nine hundred forty-one".