Base | Representation |
---|---|
bin | 11110110000011… |
… | …000100100000000 |
3 | 1022221221111221010 |
4 | 132300120210000 |
5 | 2024044000000 |
6 | 123111400520 |
7 | 15533633115 |
oct | 3660304400 |
9 | 1287844833 |
10 | 516000000 |
11 | 2452a548a |
12 | 124983140 |
13 | 82b97959 |
14 | 4c75c90c |
15 | 30478d50 |
hex | 1ec18900 |
516000000 has 252 divisors, whose sum is σ = 1756540016. Its totient is φ = 134400000.
The previous prime is 515999999. The next prime is 516000029. The reversal of 516000000 is 615.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a self number, because there is not a number n which added to its sum of digits gives 516000000.
It is an unprimeable number.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 11999979 + ... + 12000021.
Almost surely, 2516000000 is an apocalyptic number.
516000000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 516000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (878270008).
516000000 is an abundant number, since it is smaller than the sum of its proper divisors (1240540016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
516000000 is an frugal number, since it uses more digits than its factorization.
516000000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92 (or 53 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 12.
The square root of 516000000 is about 22715.6333832011. The cubic root of 516000000 is about 802.0779314117.
Adding to 516000000 its reverse (615), we get a palindrome (516000615).
The spelling of 516000000 in words is "five hundred sixteen million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •