Base | Representation |
---|---|
bin | 1100010101000… |
… | …1001000000000 |
3 | 10121022021020020 |
4 | 3011101020000 |
5 | 101214300022 |
6 | 5044213440 |
7 | 1165356225 |
oct | 305211000 |
9 | 117267206 |
10 | 51712512 |
11 | 27210415 |
12 | 1539a280 |
13 | a937a27 |
14 | 6c2194c |
15 | 481735c |
hex | 3151200 |
51712512 has 80 divisors (see below), whose sum is σ = 139357152. Its totient is φ = 17039360.
The previous prime is 51712511. The next prime is 51712519. The reversal of 51712512 is 21521715.
It is a hoax number, since the sum of its digits (24) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (51712511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 201088 + ... + 201344.
Almost surely, 251712512 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 51712512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69678576).
51712512 is an abundant number, since it is smaller than the sum of its proper divisors (87644640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51712512 is a wasteful number, since it uses less digits than its factorization.
51712512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409 (or 393 counting only the distinct ones).
The product of its digits is 700, while the sum is 24.
The square root of 51712512 is about 7191.1412168028. The cubic root of 51712512 is about 372.5619901937.
The spelling of 51712512 in words is "fifty-one million, seven hundred twelve thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •