Base | Representation |
---|---|
bin | 1001110001101… |
… | …0110011110000 |
3 | 2212011020021202 |
4 | 2130122303300 |
5 | 40444114042 |
6 | 4022510332 |
7 | 1005346661 |
oct | 234326360 |
9 | 85136252 |
10 | 41004272 |
11 | 21167131 |
12 | 118953a8 |
13 | 86589aa |
14 | 5635368 |
15 | 38ee632 |
hex | 271acf0 |
41004272 has 40 divisors (see below), whose sum is σ = 84610656. Its totient is φ = 19183616.
The previous prime is 41004259. The next prime is 41004277. The reversal of 41004272 is 27240014.
41004272 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41004277) by changing a digit.
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, 63053 + ... + 63699.
Almost surely, 241004272 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 41004272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42305328).
41004272 is an abundant number, since it is smaller than the sum of its proper divisors (43606384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41004272 is a wasteful number, since it uses less digits than its factorization.
41004272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 905 (or 899 counting only the distinct ones).
The product of its (nonzero) digits is 448, while the sum is 20.
The square root of 41004272 is about 6403.4578158992. The cubic root of 41004272 is about 344.8336998695.
Adding to 41004272 its reverse (27240014), we get a palindrome (68244286).
The spelling of 41004272 in words is "forty-one million, four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •