Base | Representation |
---|---|
bin | 1001111110101… |
… | …1100000111100 |
3 | 2220202122221020 |
4 | 2133223200330 |
5 | 41203443012 |
6 | 4053104140 |
7 | 1015540200 |
oct | 237534074 |
9 | 86678836 |
10 | 41859132 |
11 | 216a0427 |
12 | 12028050 |
13 | 8897b23 |
14 | 57b8b00 |
15 | 3a1ca8c |
hex | 27eb83c |
41859132 has 72 divisors (see below), whose sum is σ = 114471504. Its totient is φ = 11870208.
The previous prime is 41859127. The next prime is 41859133. The reversal of 41859132 is 23195814.
It is a junction number, because it is equal to n+sod(n) for n = 41859093 and 41859102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41859133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 150978 + ... + 151254.
It is an arithmetic number, because the mean of its divisors is an integer number (1589882).
Almost surely, 241859132 is an apocalyptic number.
41859132 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 41859132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57235752).
41859132 is an abundant number, since it is smaller than the sum of its proper divisors (72612372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41859132 is a wasteful number, since it uses less digits than its factorization.
41859132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 555 (or 546 counting only the distinct ones).
The product of its digits is 8640, while the sum is 33.
The square root of 41859132 is about 6469.8633679545. The cubic root of 41859132 is about 347.2136094214.
The spelling of 41859132 in words is "forty-one million, eight hundred fifty-nine thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •