Base | Representation |
---|---|
bin | 1100001101011… |
… | …0001010101000 |
3 | 10120100200100220 |
4 | 3003112022220 |
5 | 101102140442 |
6 | 5025330040 |
7 | 1161161001 |
oct | 303261250 |
9 | 116320326 |
10 | 51208872 |
11 | 269a6a90 |
12 | 15196920 |
13 | a7bc710 |
14 | 6b301a8 |
15 | 4767eec |
hex | 30d62a8 |
51208872 has 128 divisors (see below), whose sum is σ = 154344960. Its totient is φ = 13950720.
The previous prime is 51208853. The next prime is 51208889. The reversal of 51208872 is 27880215.
It is a Harshad number since it is a multiple of its sum of digits (33).
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 31 ways as a sum of consecutive naturals, for example, 147403 + ... + 147749.
It is an arithmetic number, because the mean of its divisors is an integer number (1205820).
Almost surely, 251208872 is an apocalyptic number.
51208872 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 51208872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (77172480).
51208872 is an abundant number, since it is smaller than the sum of its proper divisors (103136088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51208872 is a wasteful number, since it uses less digits than its factorization.
51208872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423 (or 419 counting only the distinct ones).
The product of its (nonzero) digits is 8960, while the sum is 33.
The square root of 51208872 is about 7156.0374509920. The cubic root of 51208872 is about 371.3485534587.
The spelling of 51208872 in words is "fifty-one million, two hundred eight thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •