Base | Representation |
---|---|
bin | 1001011010001000… |
… | …00010011010111100 |
3 | 111001000100102002220 |
4 | 10231010002122330 |
5 | 40321024004013 |
6 | 2153112245340 |
7 | 236111540001 |
oct | 45504023274 |
9 | 14030312086 |
10 | 5051000508 |
11 | 2162181494 |
12 | b8b6a0850 |
13 | 6265a74c8 |
14 | 35cb798a8 |
15 | 1e867cb23 |
hex | 12d1026bc |
5051000508 has 48 divisors (see below), whose sum is σ = 12455533440. Its totient is φ = 1588680000.
The previous prime is 5051000467. The next prime is 5051000533. The reversal of 5051000508 is 8050001505.
It is a super-3 number, since 3×50510005083 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13098 + ... + 101358.
It is an arithmetic number, because the mean of its divisors is an integer number (259490280).
Almost surely, 25051000508 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 5051000508, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6227766720).
5051000508 is an abundant number, since it is smaller than the sum of its proper divisors (7404532932).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5051000508 is a wasteful number, since it uses less digits than its factorization.
5051000508 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88538 (or 88536 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 24.
The square root of 5051000508 is about 71070.3912188472. The cubic root of 5051000508 is about 1715.7702663529.
The spelling of 5051000508 in words is "five billion, fifty-one million, five hundred eight", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •