Search a number
-
+
41084437 is a prime number
BaseRepresentation
bin1001110010111…
…0011000010101
32212022022020211
42130232120111
541004200222
64024325421
71006132462
oct234563025
985268224
1041084437
1121211389
1211913871
138686324
145656669
153918277
hex272e615

41084437 has 2 divisors, whose sum is σ = 41084438. Its totient is φ = 41084436.

The previous prime is 41084431. The next prime is 41084531. The reversal of 41084437 is 73448014.

41084437 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 can be written as a sum of positive squares in only one way, i.e., 40056241 + 1028196 = 6329^2 + 1014^2 .

It is a cyclic number.

It is not a de Polignac number, because 41084437 - 23 = 41084429 is a prime.

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

It is a congruent number.

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

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

Almost surely, 241084437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10752, while the sum is 31.

The square root of 41084437 is about 6409.7142682026. The cubic root of 41084437 is about 345.0582748302.

It can be divided in two parts, 410844 and 37, that added together give a square (410881 = 6412).

The spelling of 41084437 in words is "forty-one million, eighty-four thousand, four hundred thirty-seven".