Base | Representation |
---|---|
bin | 1010000000001… |
… | …0101101000000 |
3 | 2220221111020000 |
4 | 2200002231000 |
5 | 41220012422 |
6 | 4055120000 |
7 | 1016414124 |
oct | 240025500 |
9 | 86844200 |
10 | 41954112 |
11 | 21755822 |
12 | 12073000 |
13 | 88cc125 |
14 | 5801584 |
15 | 3a3acac |
hex | 2802b40 |
41954112 has 70 divisors (see below), whose sum is σ = 124380498. Its totient is φ = 13982976.
The previous prime is 41954089. The next prime is 41954117. The reversal of 41954112 is 21145914.
It can be written as a sum of positive squares in only one way, i.e., 34857216 + 7096896 = 5904^2 + 2664^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41954117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1138 + ... + 9230.
Almost surely, 241954112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41954112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62190249).
41954112 is an abundant number, since it is smaller than the sum of its proper divisors (82426386).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41954112 is an equidigital number, since it uses as much as digits as its factorization.
41954112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8117 (or 8098 counting only the distinct ones).
The product of its digits is 1440, while the sum is 27.
The square root of 41954112 is about 6477.1993948002. The cubic root of 41954112 is about 347.4760247766.
The spelling of 41954112 in words is "forty-one million, nine hundred fifty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •