Base | Representation |
---|---|
bin | 11111000010110… |
… | …110010100010110 |
3 | 1100022001102210210 |
4 | 133002312110112 |
5 | 2031313343340 |
6 | 123403230250 |
7 | 15623033223 |
oct | 3702662426 |
9 | 1308042723 |
10 | 520840470 |
11 | 248001177 |
12 | 126518386 |
13 | 83ba0c37 |
14 | 4d25c94a |
15 | 30ad3180 |
hex | 1f0b6516 |
520840470 has 16 divisors (see below), whose sum is σ = 1250017200. Its totient is φ = 138890784.
The previous prime is 520840469. The next prime is 520840471. The reversal of 520840470 is 74048025.
It is an interprime number because it is at equal distance from previous prime (520840469) and next prime (520840471).
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 17361349 = 520840470 / (5 + 2 + 0 + 8 + 4 + 0 + 4 + 7 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520840471) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8680645 + ... + 8680704.
It is an arithmetic number, because the mean of its divisors is an integer number (78126075).
Almost surely, 2520840470 is an apocalyptic number.
520840470 is an abundant number, since it is smaller than the sum of its proper divisors (729176730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520840470 is a wasteful number, since it uses less digits than its factorization.
520840470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17361359.
The product of its (nonzero) digits is 8960, while the sum is 30.
The square root of 520840470 is about 22821.9295853791. The cubic root of 520840470 is about 804.5781620217.
Adding to 520840470 its reverse (74048025), we get a palindrome (594888495).
The spelling of 520840470 in words is "five hundred twenty million, eight hundred forty thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •