Base | Representation |
---|---|
bin | 1010000000010… |
… | …1111000101110 |
3 | 2220222011002220 |
4 | 2200011320232 |
5 | 41220422100 |
6 | 4055300210 |
7 | 1016500131 |
oct | 240057056 |
9 | 86864086 |
10 | 41967150 |
11 | 217645a5 |
12 | 1207a666 |
13 | 8905044 |
14 | 5806218 |
15 | 3a3eaa0 |
hex | 2805e2e |
41967150 has 48 divisors (see below), whose sum is σ = 104945664. Its totient is φ = 11098080.
The previous prime is 41967137. The next prime is 41967151. The reversal of 41967150 is 5176914.
It is a super-2 number, since 2×419671502 = 3522483358245000, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41967151) 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 23 ways as a sum of consecutive naturals, for example, 17949 + ... + 20151.
It is an arithmetic number, because the mean of its divisors is an integer number (2186368).
Almost surely, 241967150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41967150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52472832).
41967150 is an abundant number, since it is smaller than the sum of its proper divisors (62978514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41967150 is a wasteful number, since it uses less digits than its factorization.
41967150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2345 (or 2340 counting only the distinct ones).
The product of its (nonzero) digits is 7560, while the sum is 33.
The square root of 41967150 is about 6478.2057701188. The cubic root of 41967150 is about 347.5120158708.
The spelling of 41967150 in words is "forty-one million, nine hundred sixty-seven thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •