Base | Representation |
---|---|
bin | 1001111010001… |
… | …1100100011010 |
3 | 2220012200200210 |
4 | 2132203210122 |
5 | 41120030232 |
6 | 4042511550 |
7 | 1013202063 |
oct | 236434432 |
9 | 86180623 |
10 | 41564442 |
11 | 21509a87 |
12 | 11b055b6 |
13 | 87c395a |
14 | 573d56a |
15 | 39b05cc |
hex | 27a391a |
41564442 has 8 divisors (see below), whose sum is σ = 83128896. Its totient is φ = 13854812.
The previous prime is 41564441. The next prime is 41564443. The reversal of 41564442 is 24446514.
It is a happy number.
41564442 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (41564441) and next prime (41564443).
It is a sphenic number, since it is the product of 3 distinct primes.
41564442 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (41564441) 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 3 ways as a sum of consecutive naturals, for example, 3463698 + ... + 3463709.
It is an arithmetic number, because the mean of its divisors is an integer number (10391112).
Almost surely, 241564442 is an apocalyptic number.
41564442 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41564442 is a wasteful number, since it uses less digits than its factorization.
41564442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6927412.
The product of its digits is 15360, while the sum is 30.
The square root of 41564442 is about 6447.0490924143. The cubic root of 41564442 is about 346.3968905008.
The spelling of 41564442 in words is "forty-one million, five hundred sixty-four thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •