Base | Representation |
---|---|
bin | 1001111001000… |
… | …0100101110101 |
3 | 2220001202001210 |
4 | 2132100211311 |
5 | 41110033314 |
6 | 4041112033 |
7 | 1012426335 |
oct | 236204565 |
9 | 86052053 |
10 | 41486709 |
11 | 21466640 |
12 | 11a88619 |
13 | 8797464 |
14 | 571d0c5 |
15 | 3997559 |
hex | 2790975 |
41486709 has 32 divisors (see below), whose sum is σ = 64143360. Its totient is φ = 23587200.
The previous prime is 41486693. The next prime is 41486717. The reversal of 41486709 is 90768414.
It is a happy number.
41486709 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 41486709 - 24 = 41486693 is a prime.
It is a super-2 number, since 2×414867092 = 3442294047301362, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41486719) 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 31 ways as a sum of consecutive naturals, for example, 79369 + ... + 79889.
It is an arithmetic number, because the mean of its divisors is an integer number (2004480).
Almost surely, 241486709 is an apocalyptic number.
It is an amenable number.
41486709 is a deficient number, since it is larger than the sum of its proper divisors (22656651).
41486709 is a wasteful number, since it uses less digits than its factorization.
41486709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681.
The product of its (nonzero) digits is 48384, while the sum is 39.
The square root of 41486709 is about 6441.0176990907. The cubic root of 41486709 is about 346.1808141990.
It can be divided in two parts, 41486 and 709, that added together give a triangular number (42195 = T290).
The spelling of 41486709 in words is "forty-one million, four hundred eighty-six thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.161 sec. • engine limits •