Base | Representation |
---|---|
bin | 11111000001100… |
… | …100100101000101 |
3 | 1100021102102112202 |
4 | 133001210211011 |
5 | 2031222140134 |
6 | 123352124245 |
7 | 15620140145 |
oct | 3701444505 |
9 | 1307372482 |
10 | 520505669 |
11 | 2478a2682 |
12 | 126396685 |
13 | 83ab4728 |
14 | 4d1b2925 |
15 | 30a68d7e |
hex | 1f064945 |
520505669 has 4 divisors (see below), whose sum is σ = 532610496. Its totient is φ = 508400844.
The previous prime is 520505651. The next prime is 520505707. The reversal of 520505669 is 966505025.
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 520505669 - 212 = 520501573 is a prime.
It is a super-2 number, since 2×5205056692 = 541852302922275122, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520505569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6052349 + ... + 6052434.
It is an arithmetic number, because the mean of its divisors is an integer number (133152624).
Almost surely, 2520505669 is an apocalyptic number.
It is an amenable number.
520505669 is a deficient number, since it is larger than the sum of its proper divisors (12104827).
520505669 is a wasteful number, since it uses less digits than its factorization.
520505669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12104826.
The product of its (nonzero) digits is 81000, while the sum is 38.
The square root of 520505669 is about 22814.5933340921. The cubic root of 520505669 is about 804.4057283445.
The spelling of 520505669 in words is "five hundred twenty million, five hundred five thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •