Base | Representation |
---|---|
bin | 1100001111000… |
… | …0100101111000 |
3 | 10120120011211210 |
4 | 3003300211320 |
5 | 101114121422 |
6 | 5031523120 |
7 | 1162121400 |
oct | 303604570 |
9 | 116504753 |
10 | 51317112 |
11 | 26a70340 |
12 | 152294a0 |
13 | a829a72 |
14 | 6b5b800 |
15 | 478a10c |
hex | 30f0978 |
51317112 has 96 divisors (see below), whose sum is σ = 162846720. Its totient is φ = 13325760.
The previous prime is 51317111. The next prime is 51317129. The reversal of 51317112 is 21171315.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51317111) 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, 10953 + ... + 14919.
It is an arithmetic number, because the mean of its divisors is an integer number (1696320).
Almost surely, 251317112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51317112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81423360).
51317112 is an abundant number, since it is smaller than the sum of its proper divisors (111529608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51317112 is a wasteful number, since it uses less digits than its factorization.
51317112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4001 (or 3990 counting only the distinct ones).
The product of its digits is 210, while the sum is 21.
The square root of 51317112 is about 7163.5963035336. The cubic root of 51317112 is about 371.6100086794.
Adding to 51317112 its reverse (21171315), we get a palindrome (72488427).
The spelling of 51317112 in words is "fifty-one million, three hundred seventeen thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •