Base | Representation |
---|---|
bin | 1001011010010000… |
… | …00101000111001100 |
3 | 111001002100020121100 |
4 | 10231020011013030 |
5 | 40321311410413 |
6 | 2153151103100 |
7 | 236123542134 |
oct | 45510050714 |
9 | 14032306540 |
10 | 5052060108 |
11 | 2162835597 |
12 | b8bb11a90 |
13 | 6268888a4 |
14 | 35cd73ac4 |
15 | 1e87dba73 |
hex | 12d2051cc |
5052060108 has 18 divisors (see below), whose sum is σ = 12770485364. Its totient is φ = 1684020024.
The previous prime is 5052060107. The next prime is 5052060121. The reversal of 5052060108 is 8010602505.
5052060108 is a `hidden beast` number, since 5 + 0 + 52 + 0 + 601 + 0 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a super-5 number, since 5×50520601085 (a number of 50 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (5052060107) 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 5 ways as a sum of consecutive naturals, for example, 70167466 + ... + 70167537.
Almost surely, 25052060108 is an apocalyptic number.
It is an amenable number.
5052060108 is an abundant number, since it is smaller than the sum of its proper divisors (7718425256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5052060108 is a wasteful number, since it uses less digits than its factorization.
5052060108 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140335013 (or 140335008 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The square root of 5052060108 is about 71077.8454091006. The cubic root of 5052060108 is about 1715.8902361858.
The spelling of 5052060108 in words is "five billion, fifty-two million, sixty thousand, one hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •