Base | Representation |
---|---|
bin | 1001101110011011… |
… | …10100010111110001 |
3 | 111110212212101020121 |
4 | 10313031310113301 |
5 | 41143130232221 |
6 | 2222035210241 |
7 | 243250425400 |
oct | 46715642761 |
9 | 14425771217 |
10 | 5221336561 |
11 | 223a343491 |
12 | 1018746981 |
13 | 65297677c |
14 | 377639637 |
15 | 2085c7a41 |
hex | 1373745f1 |
5221336561 has 12 divisors (see below), whose sum is σ = 6120172080. Its totient is φ = 4441262280.
The previous prime is 5221336543. The next prime is 5221336579. The reversal of 5221336561 is 1656331225.
It is an interprime number because it is at equal distance from previous prime (5221336543) and next prime (5221336579).
It is not a de Polignac number, because 5221336561 - 217 = 5221205489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5221336061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 400291 + ... + 413128.
It is an arithmetic number, because the mean of its divisors is an integer number (510014340).
Almost surely, 25221336561 is an apocalyptic number.
It is an amenable number.
5221336561 is a deficient number, since it is larger than the sum of its proper divisors (898835519).
5221336561 is a wasteful number, since it uses less digits than its factorization.
5221336561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 813564 (or 813557 counting only the distinct ones).
The product of its digits is 32400, while the sum is 34.
The square root of 5221336561 is about 72258.8164932142. The cubic root of 5221336561 is about 1734.8445365606.
Adding to 5221336561 its reverse (1656331225), we get a palindrome (6877667786).
The spelling of 5221336561 in words is "five billion, two hundred twenty-one million, three hundred thirty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •