Base | Representation |
---|---|
bin | 1001110110011… |
… | …0011111111101 |
3 | 2212201222120022 |
4 | 2131212133331 |
5 | 41034024201 |
6 | 4033301525 |
7 | 1011110600 |
oct | 235463775 |
9 | 85658508 |
10 | 41314301 |
11 | 21359056 |
12 | 11a048a5 |
13 | 8736b42 |
14 | 56b6337 |
15 | 396141b |
hex | 27667fd |
41314301 has 12 divisors (see below), whose sum is σ = 50887548. Its totient is φ = 33328512.
The previous prime is 41314283. The next prime is 41314309. The reversal of 41314301 is 10341314.
It can be written as a sum of positive squares in 2 ways, for example, as 15202201 + 26112100 = 3899^2 + 5110^2 .
It is not a de Polignac number, because 41314301 - 214 = 41297917 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 41314301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41314309) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 23966 + ... + 25631.
It is an arithmetic number, because the mean of its divisors is an integer number (4240629).
Almost surely, 241314301 is an apocalyptic number.
It is an amenable number.
41314301 is a deficient number, since it is larger than the sum of its proper divisors (9573247).
41314301 is a wasteful number, since it uses less digits than its factorization.
41314301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49628 (or 49621 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 41314301 is about 6427.6201661268. The cubic root of 41314301 is about 345.7006024861.
Adding to 41314301 its reverse (10341314), we get a palindrome (51655615).
The spelling of 41314301 in words is "forty-one million, three hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •