Base | Representation |
---|---|
bin | 11111000000100… |
… | …100010000100101 |
3 | 1100020221001011010 |
4 | 133000210100211 |
5 | 2031140222323 |
6 | 123342332433 |
7 | 15614662101 |
oct | 3700442045 |
9 | 1306831133 |
10 | 520242213 |
11 | 247732747 |
12 | 12628a119 |
13 | 83a2183a |
14 | 4d144901 |
15 | 30a15c93 |
hex | 1f024425 |
520242213 has 8 divisors (see below), whose sum is σ = 700524576. Its totient is φ = 343394000.
The previous prime is 520242209. The next prime is 520242227. The reversal of 520242213 is 312242025.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 520242213 - 22 = 520242209 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 520242213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520241213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 858183 + ... + 858788.
It is an arithmetic number, because the mean of its divisors is an integer number (87565572).
Almost surely, 2520242213 is an apocalyptic number.
It is an amenable number.
520242213 is a deficient number, since it is larger than the sum of its proper divisors (180282363).
520242213 is a wasteful number, since it uses less digits than its factorization.
520242213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1717075.
The product of its (nonzero) digits is 960, while the sum is 21.
The square root of 520242213 is about 22808.8187550342. The cubic root of 520242213 is about 804.2699877280.
Adding to 520242213 its reverse (312242025), we get a palindrome (832484238).
The spelling of 520242213 in words is "five hundred twenty million, two hundred forty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •