Base | Representation |
---|---|
bin | 100101110111011110101… |
… | …0100110001011110111111 |
3 | 200102112102022102000010102 |
4 | 1023232331110301132333 |
5 | 1140232033211003342 |
6 | 15022505430231315 |
7 | 1045001300562251 |
oct | 113567524613677 |
9 | 20375368360112 |
10 | 5204381734847 |
11 | 17271908a1a29 |
12 | 700788ab553b |
13 | 2b9a0411c849 |
14 | 13dc71789cd1 |
15 | 905a06c2832 |
hex | 4bbbd5317bf |
5204381734847 has 8 divisors (see below), whose sum is σ = 5209508372112. Its totient is φ = 5199255432000.
The previous prime is 5204381734841. The next prime is 5204381734873. The reversal of 5204381734847 is 7484371834025.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5204381734847 is a prime.
It is a super-2 number, since 2×52043817348472 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5204381734792 and 5204381734801.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5204381734841) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40838147 + ... + 40965387.
It is an arithmetic number, because the mean of its divisors is an integer number (651188546514).
Almost surely, 25204381734847 is an apocalyptic number.
5204381734847 is a deficient number, since it is larger than the sum of its proper divisors (5126637265).
5204381734847 is a wasteful number, since it uses less digits than its factorization.
5204381734847 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167209.
The product of its (nonzero) digits is 18063360, while the sum is 56.
The spelling of 5204381734847 in words is "five trillion, two hundred four billion, three hundred eighty-one million, seven hundred thirty-four thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •