Base | Representation |
---|---|
bin | 100011010001001101001… |
… | …1010101110110010000001 |
3 | 122011101202122002221120001 |
4 | 1012202122122232302001 |
5 | 1113404244313333023 |
6 | 14150454125320001 |
7 | 1010130645355621 |
oct | 106423232566201 |
9 | 18141678087501 |
10 | 4847313808513 |
11 | 15a9809303a50 |
12 | 663537706001 |
13 | 29213b1545b7 |
14 | 12a87b358881 |
15 | 86152dd86ad |
hex | 4689a6aec81 |
4847313808513 has 8 divisors (see below), whose sum is σ = 5292772891776. Its totient is φ = 4402653757200.
The previous prime is 4847313808489. The next prime is 4847313808517. The reversal of 4847313808513 is 3158083137484.
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 4847313808513 - 229 = 4846776937601 is a prime.
It is a super-3 number, since 3×48473138085133 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4847313808517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 199745298 + ... + 199769563.
It is an arithmetic number, because the mean of its divisors is an integer number (661596611472).
Almost surely, 24847313808513 is an apocalyptic number.
It is an amenable number.
4847313808513 is a deficient number, since it is larger than the sum of its proper divisors (445459083263).
4847313808513 is a wasteful number, since it uses less digits than its factorization.
4847313808513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399515975.
The product of its (nonzero) digits is 7741440, while the sum is 55.
The spelling of 4847313808513 in words is "four trillion, eight hundred forty-seven billion, three hundred thirteen million, eight hundred eight thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •