Base | Representation |
---|---|
bin | 11111000000111… |
… | …010100001110100 |
3 | 1100021002200021110 |
4 | 133000322201310 |
5 | 2031201132203 |
6 | 123344315020 |
7 | 15615522036 |
oct | 3700724164 |
9 | 1307080243 |
10 | 520333428 |
11 | 24779522a |
12 | 126312a70 |
13 | 83a54204 |
14 | 4d169c56 |
15 | 30a32d03 |
hex | 1f03a874 |
520333428 has 72 divisors (see below), whose sum is σ = 1285345152. Its totient is φ = 163751168.
The previous prime is 520333417. The next prime is 520333447. The reversal of 520333428 is 824333025.
It is a junction number, because it is equal to n+sod(n) for n = 520333395 and 520333404.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 473776 + ... + 474872.
It is an arithmetic number, because the mean of its divisors is an integer number (17852016).
Almost surely, 2520333428 is an apocalyptic number.
520333428 is a gapful number since it is divisible by the number (58) 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 520333428, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (642672576).
520333428 is an abundant number, since it is smaller than the sum of its proper divisors (765011724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520333428 is a wasteful number, since it uses less digits than its factorization.
520333428 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1209 (or 1178 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
The square root of 520333428 is about 22810.8182229397. The cubic root of 520333428 is about 804.3169896808.
The spelling of 520333428 in words is "five hundred twenty million, three hundred thirty-three thousand, four hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •