41262 has 24 divisors (see below), whose sum is σ = 92904. Its totient is φ = 12144.
The previous prime is 41257. The next prime is 41263. The reversal of 41262 is 26214.
It is a congruent number.
It is an inconsummate number, since it does not exist a number n which divided by its sum of digits gives 41262.
It is not an unprimeable number, because it can be changed into a prime (41263) by changing a digit.
41262 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1783 + ... + 1805.
It is an arithmetic number, because the mean of its divisors is an integer number (3871).
241262 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41262, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46452).
41262 is an abundant number, since it is smaller than the sum of its proper divisors (51642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41262 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (41261) it forms a Ruth-Aaron pair, since the sum of their prime factors is the same (64).
41262 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64 (or 41 counting only the distinct ones).
The product of its digits is 96, while the sum is 15.
The square root of 41262 is about 203.1304999255. The cubic root of 41262 is about 34.5554663334. Note that the first 3 decimals are identical.
Adding to 41262 its reverse (26214), we get a palindrome (67476).
It can be divided in two parts, 412 and 62, that added together give a palindrome (474).
The spelling of 41262 in words is "forty-one thousand, two hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •