Base | Representation |
---|---|
bin | 1010000010001101… |
… | …10000111100011000 |
3 | 111220110002010222000 |
4 | 11001012300330120 |
5 | 42013114302142 |
6 | 2250323401000 |
7 | 250333644264 |
oct | 50106607430 |
9 | 14813063860 |
10 | 5387259672 |
11 | 2314a70a23 |
12 | 1064223160 |
13 | 67b15c222 |
14 | 3916ab0a4 |
15 | 217e5014c |
hex | 1411b0f18 |
5387259672 has 32 divisors (see below), whose sum is σ = 14964610800. Its totient is φ = 1795753152.
The previous prime is 5387259671. The next prime is 5387259673. The reversal of 5387259672 is 2769527835.
5387259672 is a `hidden beast` number, since 5 + 387 + 259 + 6 + 7 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (5387259671) and next prime (5387259673).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5387259671) 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 7 ways as a sum of consecutive naturals, for example, 12470293 + ... + 12470724.
Almost surely, 25387259672 is an apocalyptic number.
It is an amenable number.
5387259672 is an abundant number, since it is smaller than the sum of its proper divisors (9577351128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5387259672 is a wasteful number, since it uses less digits than its factorization.
5387259672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24941032 (or 24941022 counting only the distinct ones).
The product of its digits is 6350400, while the sum is 54.
The square root of 5387259672 is about 73397.9541404255. The cubic root of 5387259672 is about 1753.0298177155.
The spelling of 5387259672 in words is "five billion, three hundred eighty-seven million, two hundred fifty-nine thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •