Base | Representation |
---|---|
bin | 1001110010000010… |
… | …00111110011000000 |
3 | 111112222202000200210 |
4 | 10321001013303000 |
5 | 41223400001223 |
6 | 2225035114120 |
7 | 244065355251 |
oct | 47101076300 |
9 | 14488660623 |
10 | 5251562688 |
11 | 2255408859 |
12 | 10268a2940 |
13 | 658cca658 |
14 | 37b666b28 |
15 | 20b098893 |
hex | 139047cc0 |
5251562688 has 112 divisors (see below), whose sum is σ = 14433637376. Its totient is φ = 1683348480.
The previous prime is 5251562669. The next prime is 5251562689. The reversal of 5251562688 is 8862651525.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (5251562689) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 967470 + ... + 972882.
Almost surely, 25251562688 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 5251562688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7216818688).
5251562688 is an abundant number, since it is smaller than the sum of its proper divisors (9182074688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5251562688 is a wasteful number, since it uses less digits than its factorization.
5251562688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5622 (or 5612 counting only the distinct ones).
The product of its digits is 1152000, while the sum is 48.
The square root of 5251562688 is about 72467.6665003089. Note that the first 3 decimals coincide. The cubic root of 5251562688 is about 1738.1857480390.
The spelling of 5251562688 in words is "five billion, two hundred fifty-one million, five hundred sixty-two thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •