Base | Representation |
---|---|
bin | 1001110100001… |
… | …0000100000000 |
3 | 2212110101211201 |
4 | 2131002010000 |
5 | 41014240211 |
6 | 4030150544 |
7 | 1006616512 |
oct | 235020400 |
9 | 85411751 |
10 | 41165056 |
11 | 21266a09 |
12 | 11952454 |
13 | 86b3c2a |
14 | 5677bb2 |
15 | 39320c1 |
hex | 2742100 |
41165056 has 27 divisors (see below), whose sum is σ = 82374733. Its totient is φ = 20531200.
The previous prime is 41165051. The next prime is 41165099. The reversal of 41165056 is 65056114.
The square root of 41165056 is 6416.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 40755456 + 409600 = 6384^2 + 640^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41165051) 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 2 ways as a sum of consecutive naturals, for example, 102456 + ... + 102856.
Almost surely, 241165056 is an apocalyptic number.
41165056 is the 6416-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41165056
41165056 is an abundant number, since it is smaller than the sum of its proper divisors (41209677).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41165056 is an frugal number, since it uses more digits than its factorization.
41165056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 818 (or 403 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
The cubic root of 41165056 is about 345.2838272064.
Multiplying 41165056 by its product of nonzero digits (3600), we get a square (148194201600 = 3849602).
The spelling of 41165056 in words is "forty-one million, one hundred sixty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •