Base | Representation |
---|---|
bin | 1001110010010… |
… | …1010010100000 |
3 | 2212020102011200 |
4 | 2130211102200 |
5 | 41002002300 |
6 | 4023441200 |
7 | 1005616065 |
oct | 234452240 |
9 | 85212150 |
10 | 41047200 |
11 | 21196407 |
12 | 118b6200 |
13 | 86723ac |
14 | 5646c6c |
15 | 390c200 |
hex | 27254a0 |
41047200 has 108 divisors (see below), whose sum is σ = 144768078. Its totient is φ = 10944000.
The previous prime is 41047189. The next prime is 41047207. The reversal of 41047200 is 274014.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 36433296 + 4613904 = 6036^2 + 2148^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (41047207) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 4350 + ... + 10050.
Almost surely, 241047200 is an apocalyptic number.
41047200 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41047200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72384039).
41047200 is an abundant number, since it is smaller than the sum of its proper divisors (103720878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41047200 is a wasteful number, since it uses less digits than its factorization.
41047200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5727 (or 5711 counting only the distinct ones).
The product of its (nonzero) digits is 224, while the sum is 18.
The square root of 41047200 is about 6406.8088780609. The cubic root of 41047200 is about 344.9539951259.
The spelling of 41047200 in words is "forty-one million, forty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •