Base | Representation |
---|---|
bin | 100101110100010100101… |
… | …1110100011101101111101 |
3 | 200101212221010020111011210 |
4 | 1023220221132203231331 |
5 | 1140124144203222022 |
6 | 15015425233235033 |
7 | 1044341346431355 |
oct | 113505136435575 |
9 | 20355833214153 |
10 | 5197606304637 |
11 | 1724324291a2a |
12 | 6bb3b7a02a79 |
13 | 2b91944c4346 |
14 | 13d7cb9a9b65 |
15 | 90305967a0c |
hex | 4ba297a3b7d |
5197606304637 has 16 divisors (see below), whose sum is σ = 6979103507072. Its totient is φ = 3440620497600.
The previous prime is 5197606304623. The next prime is 5197606304641. The reversal of 5197606304637 is 7364036067915.
It is not a de Polignac number, because 5197606304637 - 28 = 5197606304381 is a prime.
It is a super-2 number, since 2×51976063046372 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5197606304617) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3131614 + ... + 4494687.
It is an arithmetic number, because the mean of its divisors is an integer number (436193969192).
Almost surely, 25197606304637 is an apocalyptic number.
It is an amenable number.
5197606304637 is a deficient number, since it is larger than the sum of its proper divisors (1781497202435).
5197606304637 is a wasteful number, since it uses less digits than its factorization.
5197606304637 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7627908.
The product of its (nonzero) digits is 17146080, while the sum is 57.
The spelling of 5197606304637 in words is "five trillion, one hundred ninety-seven billion, six hundred six million, three hundred four thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •