Base | Representation |
---|---|
bin | 1111000001111010001… |
… | …00011111100100000000 |
3 | 1211100222020120211221200 |
4 | 13200331010133210000 |
5 | 31430112142213202 |
6 | 1033123531021200 |
7 | 52211246133123 |
oct | 7407504374400 |
9 | 1740866524850 |
10 | 516420663552 |
11 | 18a016002022 |
12 | 8410429a800 |
13 | 399100cba41 |
14 | 1adcddb83ba |
15 | d67751ee1c |
hex | 783d11f900 |
516420663552 has 216 divisors, whose sum is σ = 1541771212800. Its totient is φ = 166046920704.
The previous prime is 516420663541. The next prime is 516420663607. The reversal of 516420663552 is 255366024615.
516420663552 is a `hidden beast` number, since 5 + 1 + 6 + 4 + 2 + 0 + 6 + 635 + 5 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 516420663498 and 516420663507.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 85454643 + ... + 85460685.
Almost surely, 2516420663552 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 516420663552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (770885606400).
516420663552 is an abundant number, since it is smaller than the sum of its proper divisors (1025350549248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
516420663552 is a wasteful number, since it uses less digits than its factorization.
516420663552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7373 (or 7356 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 45.
The spelling of 516420663552 in words is "five hundred sixteen billion, four hundred twenty million, six hundred sixty-three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •