Search a number
-
+
41065487232 = 27372112171061
BaseRepresentation
bin100110001111101100…
…011001101110000000
310220222220221220012120
4212033230121232000
51133100231042412
630510515524240
72652432611400
oct461754315600
9126886856176
1041065487232
1116463440400
127b608b9680
133b45a3b193
141db7cc4800
151105301b8c
hex98fb19b80

41065487232 has 576 divisors, whose sum is σ = 147816763920. Its totient is φ = 10029465600.

The previous prime is 41065487191. The next prime is 41065487251. The reversal of 41065487232 is 23278456014.

It is a Harshad number since it is a multiple of its sum of digits (42).

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 38703982 + ... + 38705042.

Almost surely, 241065487232 is an apocalyptic number.

41065487232 is a gapful number since it is divisible by the number (42) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 41065487232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73908381960).

41065487232 is an abundant number, since it is smaller than the sum of its proper divisors (106751276688).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 322560, while the sum is 42.

The spelling of 41065487232 in words is "forty-one billion, sixty-five million, four hundred eighty-seven thousand, two hundred thirty-two".