Base | Representation |
---|---|
bin | 1001111011110… |
… | …1110110111101 |
3 | 2220102011102001 |
4 | 2132331312331 |
5 | 41132002000 |
6 | 4045102301 |
7 | 1014131035 |
oct | 236756675 |
9 | 86364361 |
10 | 41672125 |
11 | 21582980 |
12 | 11b57991 |
13 | 8830981 |
14 | 576a8c5 |
15 | 39d246a |
hex | 27bddbd |
41672125 has 16 divisors (see below), whose sum is σ = 56736576. Its totient is φ = 30306000.
The previous prime is 41672119. The next prime is 41672131. The reversal of 41672125 is 52127614.
It is an interprime number because it is at equal distance from previous prime (41672119) and next prime (41672131).
It is not a de Polignac number, because 41672125 - 213 = 41663933 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41672093 and 41672102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13779 + ... + 16528.
It is an arithmetic number, because the mean of its divisors is an integer number (3546036).
Almost surely, 241672125 is an apocalyptic number.
It is an amenable number.
41672125 is a deficient number, since it is larger than the sum of its proper divisors (15064451).
41672125 is a wasteful number, since it uses less digits than its factorization.
41672125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30333 (or 30323 counting only the distinct ones).
The product of its digits is 3360, while the sum is 28.
The square root of 41672125 is about 6455.3950305152. The cubic root of 41672125 is about 346.6957749021.
Adding to 41672125 its reverse (52127614), we get a palindrome (93799739).
The spelling of 41672125 in words is "forty-one million, six hundred seventy-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •