Search a number
-
+
41106051 = 3272175483
BaseRepresentation
bin1001110011001…
…1101010000011
32212100101220100
42130303222003
541010343201
64025013443
71006252500
oct234635203
985311810
1041106051
1121226648
1211924283
13869310c
1456604a7
15391e886
hex2733a83

41106051 has 36 divisors (see below), whose sum is σ = 73145592. Its totient is φ = 22103424.

The previous prime is 41106049. The next prime is 41106061. The reversal of 41106051 is 15060114.

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

It is not a de Polignac number, because 41106051 - 21 = 41106049 is a prime.

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

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

Almost surely, 241106051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5520 (or 5510 counting only the distinct ones).

The product of its (nonzero) digits is 120, while the sum is 18.

The square root of 41106051 is about 6411.4000811055. The cubic root of 41106051 is about 345.1187744793.

Adding to 41106051 its reverse (15060114), we get a palindrome (56166165).

The spelling of 41106051 in words is "forty-one million, one hundred six thousand, fifty-one".

Divisors: 1 3 7 9 17 21 49 51 63 119 147 153 357 441 833 1071 2499 5483 7497 16449 38381 49347 93211 115143 268667 279633 345429 652477 806001 838899 1957431 2418003 4567339 5872293 13702017 41106051