Base | Representation |
---|---|
bin | 11111000000111… |
… | …111100011111000 |
3 | 1100021010201112212 |
4 | 133000333203320 |
5 | 2031202312130 |
6 | 123344554252 |
7 | 15615636113 |
oct | 3700774370 |
9 | 1307121485 |
10 | 520354040 |
11 | 2477a9768 |
12 | 126322988 |
13 | 83a606cb |
14 | 4d17357a |
15 | 30a38e95 |
hex | 1f03f8f8 |
520354040 has 64 divisors (see below), whose sum is σ = 1206144000. Its totient is φ = 201951360.
The previous prime is 520354033. The next prime is 520354057. The reversal of 520354040 is 40453025.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 520353997 and 520354015.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 185045 + ... + 187835.
It is an arithmetic number, because the mean of its divisors is an integer number (18846000).
Almost surely, 2520354040 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 520354040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (603072000).
520354040 is an abundant number, since it is smaller than the sum of its proper divisors (685789960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520354040 is a wasteful number, since it uses less digits than its factorization.
520354040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2940 (or 2936 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 23.
The square root of 520354040 is about 22811.2700216362. The cubic root of 520354040 is about 804.3276100266.
The spelling of 520354040 in words is "five hundred twenty million, three hundred fifty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •