Base | Representation |
---|---|
bin | 11111000001101… |
… | …010010100000000 |
3 | 1100021110121202111 |
4 | 133001222110000 |
5 | 2031223413102 |
6 | 123352425104 |
7 | 15620265463 |
oct | 3701522400 |
9 | 1307417674 |
10 | 520529152 |
11 | 247909290 |
12 | 1263a8194 |
13 | 83ac2320 |
14 | 4d1bb2da |
15 | 30a70cd7 |
hex | 1f06a500 |
520529152 has 144 divisors (see below), whose sum is σ = 1246512960. Its totient is φ = 213811200.
The previous prime is 520529129. The next prime is 520529197. The reversal of 520529152 is 251925025.
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 15 ways as a sum of consecutive naturals, for example, 2159752 + ... + 2159992.
It is an arithmetic number, because the mean of its divisors is an integer number (8656340).
Almost surely, 2520529152 is an apocalyptic number.
520529152 is a gapful number since it is divisible by the number (52) 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 520529152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (623256480).
520529152 is an abundant number, since it is smaller than the sum of its proper divisors (725983808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520529152 is a wasteful number, since it uses less digits than its factorization.
520529152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340 (or 326 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 31.
The square root of 520529152 is about 22815.1079769525. The cubic root of 520529152 is about 804.4178252833.
The spelling of 520529152 in words is "five hundred twenty million, five hundred twenty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •