Base | Representation |
---|---|
bin | 1100001110100… |
… | …0100010011100 |
3 | 10120111111121000 |
4 | 3003220202130 |
5 | 101112042444 |
6 | 5031110300 |
7 | 1161623253 |
oct | 303504234 |
9 | 116444530 |
10 | 51284124 |
11 | 26a48581 |
12 | 15212390 |
13 | a817a48 |
14 | 6b4d79a |
15 | 4780469 |
hex | 30e889c |
51284124 has 48 divisors (see below), whose sum is σ = 134041600. Its totient is φ = 16955568.
The previous prime is 51284047. The next prime is 51284131. The reversal of 51284124 is 42148215.
It is a super-2 number, since 2×512841242 = 5260122748894752, which contains 22 as substring.
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 pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11847 + ... + 15585.
Almost surely, 251284124 is an apocalyptic number.
51284124 is a gapful number since it is divisible by the number (54) 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 51284124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67020800).
51284124 is an abundant number, since it is smaller than the sum of its proper divisors (82757476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51284124 is a wasteful number, since it uses less digits than its factorization.
51284124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3879 (or 3871 counting only the distinct ones).
The product of its digits is 2560, while the sum is 27.
The square root of 51284124 is about 7161.2934585869. The cubic root of 51284124 is about 371.5303646896.
The spelling of 51284124 in words is "fifty-one million, two hundred eighty-four thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •