Base | Representation |
---|---|
bin | 1001110010001… |
… | …0100111001101 |
3 | 2212012212010122 |
4 | 2130202213031 |
5 | 41001124422 |
6 | 4023314325 |
7 | 1005542114 |
oct | 234424715 |
9 | 85185118 |
10 | 41036237 |
11 | 21189150 |
12 | 118ab9a5 |
13 | 866a3c8 |
14 | 5642c7b |
15 | 3908d42 |
hex | 27229cd |
41036237 has 8 divisors (see below), whose sum is σ = 44970240. Its totient is φ = 37136160.
The previous prime is 41036231. The next prime is 41036243. The reversal of 41036237 is 73263014.
41036237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (41036231) and next prime (41036243).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 41036237 - 24 = 41036221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41036231) 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 7 ways as a sum of consecutive naturals, for example, 5912 + ... + 10817.
It is an arithmetic number, because the mean of its divisors is an integer number (5621280).
Almost surely, 241036237 is an apocalyptic number.
It is an amenable number.
41036237 is a deficient number, since it is larger than the sum of its proper divisors (3934003).
41036237 is a wasteful number, since it uses less digits than its factorization.
41036237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16963.
The product of its (nonzero) digits is 3024, while the sum is 26.
The square root of 41036237 is about 6405.9532467854. The cubic root of 41036237 is about 344.9232819682.
The spelling of 41036237 in words is "forty-one million, thirty-six thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •