Base | Representation |
---|---|
bin | 11111000010111… |
… | …010001000000000 |
3 | 1100022002020012100 |
4 | 133002322020000 |
5 | 2031314343224 |
6 | 123403430400 |
7 | 15623126541 |
oct | 3702721000 |
9 | 1308066170 |
10 | 520856064 |
11 | 248011963 |
12 | 126525400 |
13 | 83ba8071 |
14 | 4d2644c8 |
15 | 30ad7ac9 |
hex | 1f0ba200 |
520856064 has 240 divisors, whose sum is σ = 1632585240. Its totient is φ = 159252480.
The previous prime is 520856059. The next prime is 520856099. The reversal of 520856064 is 460658025.
It can be written as a sum of positive squares in 4 ways, for example, as 424030464 + 96825600 = 20592^2 + 9840^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 4778442 + ... + 4778550.
Almost surely, 2520856064 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 520856064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (816292620).
520856064 is an abundant number, since it is smaller than the sum of its proper divisors (1111729176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520856064 is a wasteful number, since it uses less digits than its factorization.
520856064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211 (or 192 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The square root of 520856064 is about 22822.2712279037. The cubic root of 520856064 is about 804.5861916504.
The spelling of 520856064 in words is "five hundred twenty million, eight hundred fifty-six thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •