Base | Representation |
---|---|
bin | 1001111001111… |
… | …0110010001000 |
3 | 2220011200210210 |
4 | 2132132302020 |
5 | 41113413330 |
6 | 4042241120 |
7 | 1013060661 |
oct | 236366210 |
9 | 86150723 |
10 | 41544840 |
11 | 214a6287 |
12 | 11ab61a0 |
13 | 87b7a5c |
14 | 5736368 |
15 | 39a98b0 |
hex | 279ec88 |
41544840 has 32 divisors (see below), whose sum is σ = 124634880. Its totient is φ = 11078592.
The previous prime is 41544829. The next prime is 41544857. The reversal of 41544840 is 4844514.
41544840 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 41544798 and 41544807.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 172984 + ... + 173223.
It is an arithmetic number, because the mean of its divisors is an integer number (3894840).
Almost surely, 241544840 is an apocalyptic number.
41544840 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41544840 is an abundant number, since it is smaller than the sum of its proper divisors (83090040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41544840 is a wasteful number, since it uses less digits than its factorization.
41544840 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346221 (or 346217 counting only the distinct ones).
The product of its (nonzero) digits is 10240, while the sum is 30.
The square root of 41544840 is about 6445.5286827381. The cubic root of 41544840 is about 346.3424277660.
The spelling of 41544840 in words is "forty-one million, five hundred forty-four thousand, eight hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •