Base | Representation |
---|---|
bin | 1111001001010111101… |
… | …01001100001101111101 |
3 | 1211202022102002200122000 |
4 | 13210223311030031331 |
5 | 32011313130004111 |
6 | 1035025224012513 |
7 | 52412436316611 |
oct | 7445365141575 |
9 | 1752272080560 |
10 | 520426406781 |
11 | 190791159216 |
12 | 84a41901139 |
13 | 3a0cac815c8 |
14 | 1b28ddc5341 |
15 | d80e02bc56 |
hex | 792bd4c37d |
520426406781 has 8 divisors (see below), whose sum is σ = 771002084160. Its totient is φ = 346950937836.
The previous prime is 520426406767. The next prime is 520426406789. The reversal of 520426406781 is 187604624025.
520426406781 is a `hidden beast` number, since 52 + 0 + 426 + 40 + 67 + 81 = 666.
It is not a de Polignac number, because 520426406781 - 210 = 520426405757 is a prime.
It is a super-2 number, since 2×5204264067812 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520426406789) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9637526025 + ... + 9637526078.
It is an arithmetic number, because the mean of its divisors is an integer number (96375260520).
Almost surely, 2520426406781 is an apocalyptic number.
It is an amenable number.
520426406781 is a deficient number, since it is larger than the sum of its proper divisors (250575677379).
520426406781 is a wasteful number, since it uses less digits than its factorization.
520426406781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19275052112 (or 19275052106 counting only the distinct ones).
The product of its (nonzero) digits is 645120, while the sum is 45.
The spelling of 520426406781 in words is "five hundred twenty billion, four hundred twenty-six million, four hundred six thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •