Base | Representation |
---|---|
bin | 1001111010111… |
… | …1110100101100 |
3 | 2220022020112211 |
4 | 2132233310230 |
5 | 41123132021 |
6 | 4043540204 |
7 | 1013501320 |
oct | 236576454 |
9 | 86266484 |
10 | 41614636 |
11 | 21543768 |
12 | 11b2a664 |
13 | 881075b |
14 | 5753980 |
15 | 39c03e1 |
hex | 27afd2c |
41614636 has 72 divisors (see below), whose sum is σ = 92171520. Its totient is φ = 16071264.
The previous prime is 41614633. The next prime is 41614663. The reversal of 41614636 is 63641614.
It is a junction number, because it is equal to n+sod(n) for n = 41614598 and 41614607.
It is not an unprimeable number, because it can be changed into a prime (41614633) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 232395 + ... + 232573.
It is an arithmetic number, because the mean of its divisors is an integer number (1280160).
Almost surely, 241614636 is an apocalyptic number.
41614636 is a gapful number since it is divisible by the number (46) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41614636, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46085760).
41614636 is an abundant number, since it is smaller than the sum of its proper divisors (50556884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41614636 is a wasteful number, since it uses less digits than its factorization.
41614636 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251 (or 230 counting only the distinct ones).
The product of its digits is 10368, while the sum is 31.
The square root of 41614636 is about 6450.9407065947. The cubic root of 41614636 is about 346.5362728703.
The spelling of 41614636 in words is "forty-one million, six hundred fourteen thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •