Base | Representation |
---|---|
bin | 11110100101000… |
… | …011100100000000 |
3 | 1022202100122101221 |
4 | 132211003210000 |
5 | 2022313433100 |
6 | 122524004424 |
7 | 15466454311 |
oct | 3645034400 |
9 | 1282318357 |
10 | 513030400 |
11 | 243657373 |
12 | 123990714 |
13 | 823980ac |
14 | 4c1c8608 |
15 | 3008e01a |
hex | 1e943900 |
513030400 has 108 divisors (see below), whose sum is σ = 1336980400. Its totient is φ = 194365440.
The previous prime is 513030389. The next prime is 513030421. The reversal of 513030400 is 4030315.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 119491 + ... + 123709.
Almost surely, 2513030400 is an apocalyptic number.
513030400 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 513030400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (668490200).
513030400 is an abundant number, since it is smaller than the sum of its proper divisors (823950000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
513030400 is a wasteful number, since it uses less digits than its factorization.
513030400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4264 (or 4245 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 513030400 is about 22650.1743922646. The cubic root of 513030400 is about 800.5363070548.
Adding to 513030400 its reverse (4030315), we get a palindrome (517060715).
The spelling of 513030400 in words is "five hundred thirteen million, thirty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •