Base | Representation |
---|---|
bin | 1001110111101… |
… | …0001101011000 |
3 | 2212220002022100 |
4 | 2131322031120 |
5 | 41044120112 |
6 | 4035123400 |
7 | 1011565140 |
oct | 235721530 |
9 | 85802270 |
10 | 41395032 |
11 | 21403778 |
12 | 11a43560 |
13 | 8764803 |
14 | 56d7920 |
15 | 397a2dc |
hex | 277a358 |
41395032 has 96 divisors (see below), whose sum is σ = 133735680. Its totient is φ = 11309760.
The previous prime is 41395021. The next prime is 41395037. The reversal of 41395032 is 23059314.
It is a junction number, because it is equal to n+sod(n) for n = 41394987 and 41395005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41395037) 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, 9807 + ... + 13377.
It is an arithmetic number, because the mean of its divisors is an integer number (1393080).
Almost surely, 241395032 is an apocalyptic number.
41395032 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 41395032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (66867840).
41395032 is an abundant number, since it is smaller than the sum of its proper divisors (92340648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41395032 is a wasteful number, since it uses less digits than its factorization.
41395032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3613 (or 3606 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 41395032 is about 6433.8971082851. The cubic root of 41395032 is about 345.9256302677.
The spelling of 41395032 in words is "forty-one million, three hundred ninety-five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •