Base | Representation |
---|---|
bin | 1010010111001110… |
… | …01010000101110101 |
3 | 112100201202021101220 |
4 | 11023213022011311 |
5 | 42343230222240 |
6 | 2320021340553 |
7 | 254604111654 |
oct | 51347120565 |
9 | 15321667356 |
10 | 5563523445 |
11 | 23a5511567 |
12 | 10b3267759 |
13 | 6a882560c |
14 | 3aac7119b |
15 | 22866b5d0 |
hex | 14b9ca175 |
5563523445 has 32 divisors (see below), whose sum is σ = 9474693120. Its totient is φ = 2778024960.
The previous prime is 5563523443. The next prime is 5563523453. The reversal of 5563523445 is 5443253655.
It is a happy number.
5563523445 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5563523445 - 21 = 5563523443 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5563523397 and 5563523406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5563523443) 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 31 ways as a sum of consecutive naturals, for example, 8410 + ... + 105819.
It is an arithmetic number, because the mean of its divisors is an integer number (296084160).
Almost surely, 25563523445 is an apocalyptic number.
It is an amenable number.
5563523445 is a deficient number, since it is larger than the sum of its proper divisors (3911169675).
5563523445 is a wasteful number, since it uses less digits than its factorization.
5563523445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114445.
The product of its digits is 1080000, while the sum is 42.
The square root of 5563523445 is about 74589.0303261813. The cubic root of 5563523445 is about 1771.9439254345.
The spelling of 5563523445 in words is "five billion, five hundred sixty-three million, five hundred twenty-three thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •