Base | Representation |
---|---|
bin | 1001111000001… |
… | …1111110111000 |
3 | 2212222010020000 |
4 | 2132003332320 |
5 | 41101410224 |
6 | 4040033000 |
7 | 1012122636 |
oct | 236037670 |
9 | 85863200 |
10 | 41435064 |
11 | 21430860 |
12 | 11a62760 |
13 | 8779ab8 |
14 | 5708356 |
15 | 39870c9 |
hex | 2783fb8 |
41435064 has 80 divisors (see below), whose sum is σ = 126628920. Its totient is φ = 12553920.
The previous prime is 41435041. The next prime is 41435081. The reversal of 41435064 is 46053414.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4222 + ... + 10034.
Almost surely, 241435064 is an apocalyptic number.
41435064 is a gapful number since it is divisible by the number (44) 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 41435064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63314460).
41435064 is an abundant number, since it is smaller than the sum of its proper divisors (85193856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41435064 is a wasteful number, since it uses less digits than its factorization.
41435064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5842 (or 5829 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 41435064 is about 6437.0073792097. The cubic root of 41435064 is about 346.0371060698.
Adding to 41435064 its reverse (46053414), we get a palindrome (87488478).
It can be divided in two parts, 414350 and 64, that added together give a palindrome (414414).
The spelling of 41435064 in words is "forty-one million, four hundred thirty-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •