Base | Representation |
---|---|
bin | 11111000010010… |
… | …101000001111001 |
3 | 1100021210111202211 |
4 | 133002111001321 |
5 | 2031300012441 |
6 | 123400255121 |
7 | 15621624550 |
oct | 3702250171 |
9 | 1307714684 |
10 | 520704121 |
11 | 247a18793 |
12 | 1264714a1 |
13 | 83b53b62 |
14 | 4d224d97 |
15 | 30aa7a81 |
hex | 1f095079 |
520704121 has 4 divisors (see below), whose sum is σ = 595090432. Its totient is φ = 446317812.
The previous prime is 520704097. The next prime is 520704133. The reversal of 520704121 is 121407025.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 520704121 - 29 = 520703609 is a prime.
It is a super-2 number, since 2×5207041212 = 542265563252765282, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 520704092 and 520704101.
It is not an unprimeable number, because it can be changed into a prime (520704181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37193145 + ... + 37193158.
It is an arithmetic number, because the mean of its divisors is an integer number (148772608).
Almost surely, 2520704121 is an apocalyptic number.
It is an amenable number.
520704121 is a deficient number, since it is larger than the sum of its proper divisors (74386311).
520704121 is an equidigital number, since it uses as much as digits as its factorization.
520704121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74386310.
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 520704121 is about 22818.9421533953. The cubic root of 520704121 is about 804.5079466625.
The spelling of 520704121 in words is "five hundred twenty million, seven hundred four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •