Base | Representation |
---|---|
bin | 1001100110001011… |
… | …01001100001011100 |
3 | 111022001120002111000 |
4 | 10303011221201130 |
5 | 41022413223413 |
6 | 2211123030300 |
7 | 241450003131 |
oct | 46305514134 |
9 | 14261502430 |
10 | 5152086108 |
11 | 2204244604 |
12 | bb950b390 |
13 | 64150b180 |
14 | 36c370588 |
15 | 202499073 |
hex | 13316985c |
5152086108 has 192 divisors, whose sum is σ = 14971264000. Its totient is φ = 1521918720.
The previous prime is 5152086097. The next prime is 5152086119. The reversal of 5152086108 is 8016802515.
5152086108 is a `hidden beast` number, since 5 + 15 + 20 + 8 + 610 + 8 = 666.
It is an interprime number because it is at equal distance from previous prime (5152086097) and next prime (5152086119).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3681993 + ... + 3683391.
Almost surely, 25152086108 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 5152086108, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7485632000).
5152086108 is an abundant number, since it is smaller than the sum of its proper divisors (9819177892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5152086108 is a wasteful number, since it uses less digits than its factorization.
5152086108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1529 (or 1521 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 36.
The square root of 5152086108 is about 71778.0336036033. The cubic root of 5152086108 is about 1727.1406437863.
The spelling of 5152086108 in words is "five billion, one hundred fifty-two million, eighty-six thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •