Base | Representation |
---|---|
bin | 1001110011011… |
… | …1110010001000 |
3 | 2212101021002022 |
4 | 2130313302020 |
5 | 41011413302 |
6 | 4025224012 |
7 | 1006352663 |
oct | 234676210 |
9 | 85337068 |
10 | 41122952 |
11 | 21238312 |
12 | 11932008 |
13 | 869aa10 |
14 | 56666da |
15 | 39248a2 |
hex | 2737c88 |
41122952 has 32 divisors (see below), whose sum is σ = 83496000. Its totient is φ = 18874944.
The previous prime is 41122937. The next prime is 41122993. The reversal of 41122952 is 25922114.
41122952 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 (26).
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, 19703 + ... + 21689.
It is an arithmetic number, because the mean of its divisors is an integer number (2609250).
Almost surely, 241122952 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 41122952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (41748000).
41122952 is an abundant number, since it is smaller than the sum of its proper divisors (42373048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41122952 is a wasteful number, since it uses less digits than its factorization.
41122952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2205 (or 2201 counting only the distinct ones).
The product of its digits is 1440, while the sum is 26.
The square root of 41122952 is about 6412.7179884975. The cubic root of 41122952 is about 345.1660672180.
The spelling of 41122952 in words is "forty-one million, one hundred twenty-two thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •