Base | Representation |
---|---|
bin | 1001101110110100… |
… | …10010110110100001 |
3 | 111111010000112122001 |
4 | 10313122102312201 |
5 | 41144444412022 |
6 | 2222233244001 |
7 | 243320266531 |
oct | 46732226641 |
9 | 14433015561 |
10 | 5224607137 |
11 | 2241177742 |
12 | 1019863601 |
13 | 653550319 |
14 | 377c4b4c1 |
15 | 208a21b27 |
hex | 137692da1 |
5224607137 has 8 divisors (see below), whose sum is σ = 5581671200. Its totient is φ = 4875751584.
The previous prime is 5224607111. The next prime is 5224607183. The reversal of 5224607137 is 7317064225.
It is a happy number.
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 5224607137 - 27 = 5224607009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5224607096 and 5224607105.
It is not an unprimeable number, because it can be changed into a prime (5224607197) 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 7 ways as a sum of consecutive naturals, for example, 2050812 + ... + 2053357.
It is an arithmetic number, because the mean of its divisors is an integer number (697708900).
Almost surely, 25224607137 is an apocalyptic number.
It is an amenable number.
5224607137 is a deficient number, since it is larger than the sum of its proper divisors (357064063).
5224607137 is a wasteful number, since it uses less digits than its factorization.
5224607137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4104255.
The product of its (nonzero) digits is 70560, while the sum is 37.
The square root of 5224607137 is about 72281.4439327273. The cubic root of 5224607137 is about 1735.2066888280.
The spelling of 5224607137 in words is "five billion, two hundred twenty-four million, six hundred seven thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •