Base | Representation |
---|---|
bin | 1100001111110… |
… | …1110001101000 |
3 | 10120122220220210 |
4 | 3003331301220 |
5 | 101122333422 |
6 | 5033021120 |
7 | 1162435002 |
oct | 303756150 |
9 | 116586823 |
10 | 51371112 |
11 | 26aa7971 |
12 | 152547a0 |
13 | a848510 |
14 | 6b73372 |
15 | 479b10c |
hex | 30fdc68 |
51371112 has 64 divisors (see below), whose sum is σ = 139104000. Its totient is φ = 15715584.
The previous prime is 51371083. The next prime is 51371129. The reversal of 51371112 is 21117315.
It is a happy number.
It is a super-2 number, since 2×513711122 = 5277982296233088, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71089 + ... + 71807.
It is an arithmetic number, because the mean of its divisors is an integer number (2173500).
Almost surely, 251371112 is an apocalyptic number.
51371112 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 51371112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69552000).
51371112 is an abundant number, since it is smaller than the sum of its proper divisors (87732888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51371112 is a wasteful number, since it uses less digits than its factorization.
51371112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 970 (or 966 counting only the distinct ones).
The product of its digits is 210, while the sum is 21.
The square root of 51371112 is about 7167.3643691388. The cubic root of 51371112 is about 371.7403089835.
Adding to 51371112 its reverse (21117315), we get a palindrome (72488427).
The spelling of 51371112 in words is "fifty-one million, three hundred seventy-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •