Base | Representation |
---|---|
bin | 1010011100100010… |
… | …00000010010110100 |
3 | 112110211112100022221 |
4 | 11032101000102310 |
5 | 42441130012141 |
6 | 2324251532124 |
7 | 255654422401 |
oct | 51621002264 |
9 | 15424470287 |
10 | 5608047796 |
11 | 241866234a |
12 | 110615a044 |
13 | 6b4b145a0 |
14 | 3b2b412a8 |
15 | 22c513bd1 |
hex | 14e4404b4 |
5608047796 has 12 divisors (see below), whose sum is σ = 10569013252. Its totient is φ = 2588329728.
The previous prime is 5608047793. The next prime is 5608047799. The reversal of 5608047796 is 6977408065.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (5608047793) and next prime (5608047799).
It can be written as a sum of positive squares in 2 ways, for example, as 3580346896 + 2027700900 = 59836^2 + 45030^2 .
It is a Harshad number since it is a multiple of its sum of digits (52), and also a Moran number because the ratio is a prime number: 107847073 = 5608047796 / (5 + 6 + 0 + 8 + 0 + 4 + 7 + 7 + 9 + 6).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5608047793) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 53923485 + ... + 53923588.
Almost surely, 25608047796 is an apocalyptic number.
It is an amenable number.
5608047796 is a deficient number, since it is larger than the sum of its proper divisors (4960965456).
5608047796 is a wasteful number, since it uses less digits than its factorization.
5608047796 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107847090 (or 107847088 counting only the distinct ones).
The product of its (nonzero) digits is 2540160, while the sum is 52.
The square root of 5608047796 is about 74886.9000293109. The cubic root of 5608047796 is about 1776.6582713393.
The spelling of 5608047796 in words is "five billion, six hundred eight million, forty-seven thousand, seven hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •