Base | Representation |
---|---|
bin | 1100001010110… |
… | …1111111000100 |
3 | 10120001022121100 |
4 | 3002231333010 |
5 | 101031404132 |
6 | 5022020100 |
7 | 1156604115 |
oct | 302557704 |
9 | 116038540 |
10 | 51044292 |
11 | 268a4372 |
12 | 15117630 |
13 | a762830 |
14 | 6aca20c |
15 | 473437c |
hex | 30adfc4 |
51044292 has 72 divisors (see below), whose sum is σ = 143783640. Its totient is φ = 15160320.
The previous prime is 51044269. The next prime is 51044293. The reversal of 51044292 is 29244015.
It can be written as a sum of positive squares in 4 ways, for example, as 1679616 + 49364676 = 1296^2 + 7026^2 .
It is not an unprimeable number, because it can be changed into a prime (51044293) 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, 11692 + ... + 15452.
It is an arithmetic number, because the mean of its divisors is an integer number (1996995).
Almost surely, 251044292 is an apocalyptic number.
51044292 is a gapful number since it is divisible by the number (52) 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 51044292, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71891820).
51044292 is an abundant number, since it is smaller than the sum of its proper divisors (92739348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51044292 is a wasteful number, since it uses less digits than its factorization.
51044292 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3813 (or 3808 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 51044292 is about 7144.5288158142. The cubic root of 51044292 is about 370.9503012694.
The spelling of 51044292 in words is "fifty-one million, forty-four thousand, two hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •