Base | Representation |
---|---|
bin | 11111001000001… |
… | …101001111111001 |
3 | 1100101200210121121 |
4 | 133020031033321 |
5 | 2032143320423 |
6 | 123453305241 |
7 | 15641003335 |
oct | 3710151771 |
9 | 1311623547 |
10 | 522245113 |
11 | 248880535 |
12 | 126a95221 |
13 | 842733a0 |
14 | 4d5067c5 |
15 | 30cae45d |
hex | 1f20d3f9 |
522245113 has 4 divisors (see below), whose sum is σ = 562417828. Its totient is φ = 482072400.
The previous prime is 522245099. The next prime is 522245161. The reversal of 522245113 is 311542225.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 100641024 + 421604089 = 10032^2 + 20533^2 .
It is a cyclic number.
It is not a de Polignac number, because 522245113 - 25 = 522245081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (522245173) 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 3 ways as a sum of consecutive naturals, for example, 20086338 + ... + 20086363.
It is an arithmetic number, because the mean of its divisors is an integer number (140604457).
Almost surely, 2522245113 is an apocalyptic number.
It is an amenable number.
522245113 is a deficient number, since it is larger than the sum of its proper divisors (40172715).
522245113 is a wasteful number, since it uses less digits than its factorization.
522245113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40172714.
The product of its digits is 2400, while the sum is 25.
The square root of 522245113 is about 22852.6828403144. The cubic root of 522245113 is about 805.3007957349.
Adding to 522245113 its reverse (311542225), we get a palindrome (833787338).
The spelling of 522245113 in words is "five hundred twenty-two million, two hundred forty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •