Base | Representation |
---|---|
bin | 1001110011001… |
… | …1001010011111 |
3 | 2212100022010112 |
4 | 2130303022133 |
5 | 41010312111 |
6 | 4025000235 |
7 | 1006243553 |
oct | 234631237 |
9 | 85308115 |
10 | 41104031 |
11 | 21225081 |
12 | 1192307b |
13 | 8692217 |
14 | 565d863 |
15 | 391de8b |
hex | 273329f |
41104031 has 4 divisors (see below), whose sum is σ = 41717592. Its totient is φ = 40490472.
The previous prime is 41103989. The next prime is 41104033. The reversal of 41104031 is 13040114.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13040114 = 2 ⋅6520057.
It is a cyclic number.
It is not a de Polignac number, because 41104031 - 214 = 41087647 is a prime.
It is a super-2 number, since 2×411040312 = 3379082728897922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41103997 and 41104015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41104033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 306680 + ... + 306813.
It is an arithmetic number, because the mean of its divisors is an integer number (10429398).
Almost surely, 241104031 is an apocalyptic number.
41104031 is a deficient number, since it is larger than the sum of its proper divisors (613561).
41104031 is an equidigital number, since it uses as much as digits as its factorization.
41104031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613560.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 41104031 is about 6411.2425472758. The cubic root of 41104031 is about 345.1131212050.
Adding to 41104031 its reverse (13040114), we get a palindrome (54144145).
The spelling of 41104031 in words is "forty-one million, one hundred four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •