Search a number
-
+
41050567 = 537110909
BaseRepresentation
bin1001110010011…
…0000111000111
32212020120210101
42130212013013
541002104232
64023504531
71005631645
oct234460707
985216711
1041050567
1121198998
12118b8147
138673a9c
145648195
15390d1e7
hex27261c7

41050567 has 8 divisors (see below), whose sum is σ = 42418080. Its totient is φ = 39705120.

The previous prime is 41050531. The next prime is 41050577. The reversal of 41050567 is 76505014.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 41050567 - 27 = 41050439 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (41050577) 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 in 7 ways as a sum of consecutive naturals, for example, 1692 + ... + 9217.

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

Almost surely, 241050567 is an apocalyptic number.

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

41050567 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 11033.

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

The square root of 41050567 is about 6407.0716399928. The cubic root of 41050567 is about 344.9634267749.

The spelling of 41050567 in words is "forty-one million, fifty thousand, five hundred sixty-seven".

Divisors: 1 53 71 3763 10909 578177 774539 41050567