Base | Representation |
---|---|
bin | 1111001010001010110… |
… | …01101000100011010000 |
3 | 1211210102022022022112210 |
4 | 13211011121220203100 |
5 | 32013202434443131 |
6 | 1035135550352120 |
7 | 52426165525014 |
oct | 7450531504320 |
9 | 1753368268483 |
10 | 520855390416 |
11 | 19099131aa49 |
12 | 84b414bb640 |
13 | 3a168b0038a |
14 | 1b2d0d72544 |
15 | d836a18146 |
hex | 79456688d0 |
520855390416 has 80 divisors (see below), whose sum is σ = 1392208392960. Its totient is φ = 167599434240.
The previous prime is 520855390411. The next prime is 520855390421. The reversal of 520855390416 is 614093558025.
It is an interprime number because it is at equal distance from previous prime (520855390411) and next prime (520855390421).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520855390411) by changing a digit.
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, 7835881 + ... + 7902071.
It is an arithmetic number, because the mean of its divisors is an integer number (17402604912).
Almost surely, 2520855390416 is an apocalyptic number.
It is an amenable number.
520855390416 is an abundant number, since it is smaller than the sum of its proper divisors (871353002544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
520855390416 is a wasteful number, since it uses less digits than its factorization.
520855390416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71884 (or 71878 counting only the distinct ones).
The product of its (nonzero) digits is 1296000, while the sum is 48.
The spelling of 520855390416 in words is "five hundred twenty billion, eight hundred fifty-five million, three hundred ninety thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •