Base | Representation |
---|---|
bin | 1001110011000… |
… | …0011001100001 |
3 | 2212022201121001 |
4 | 2130300121201 |
5 | 41004431310 |
6 | 4024432001 |
7 | 1006165543 |
oct | 234603141 |
9 | 85281531 |
10 | 41092705 |
11 | 21217615 |
12 | 11918601 |
13 | 868a014 |
14 | 5659693 |
15 | 391a93a |
hex | 2730661 |
41092705 has 4 divisors (see below), whose sum is σ = 49311252. Its totient is φ = 32874160.
The previous prime is 41092703. The next prime is 41092721. The reversal of 41092705 is 50729014.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 15610401 + 25482304 = 3951^2 + 5048^2 .
It is not a de Polignac number, because 41092705 - 21 = 41092703 is a prime.
It is a super-2 number, since 2×410927052 = 3377220808434050, which contains 22 as substring.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41092703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4109266 + ... + 4109275.
It is an arithmetic number, because the mean of its divisors is an integer number (12327813).
Almost surely, 241092705 is an apocalyptic number.
It is an amenable number.
41092705 is a deficient number, since it is larger than the sum of its proper divisors (8218547).
41092705 is an equidigital number, since it uses as much as digits as its factorization.
41092705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8218546.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 41092705 is about 6410.3591943042. The cubic root of 41092705 is about 345.0814202567.
The spelling of 41092705 in words is "forty-one million, ninety-two thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •