Base | Representation |
---|---|
bin | 1001110101011… |
… | …0010100100000 |
3 | 2212121121122220 |
4 | 2131112110200 |
5 | 41024414112 |
6 | 4032031040 |
7 | 1010413440 |
oct | 235262440 |
9 | 85547586 |
10 | 41248032 |
11 | 21313291 |
12 | 11992480 |
13 | 8712927 |
14 | 569a120 |
15 | 394b98c |
hex | 2756520 |
41248032 has 48 divisors (see below), whose sum is σ = 123746112. Its totient is φ = 11784960.
The previous prime is 41248003. The next prime is 41248037. The reversal of 41248032 is 23084214.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 41247993 and 41248011.
It is not an unprimeable number, because it can be changed into a prime (41248037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30019 + ... + 31362.
It is an arithmetic number, because the mean of its divisors is an integer number (2578044).
Almost surely, 241248032 is an apocalyptic number.
41248032 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
41248032 is an abundant number, since it is smaller than the sum of its proper divisors (82498080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41248032 is a wasteful number, since it uses less digits than its factorization.
41248032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61401 (or 61393 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 41248032 is about 6422.4630789129. The cubic root of 41248032 is about 345.5156665797.
The spelling of 41248032 in words is "forty-one million, two hundred forty-eight thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •