Base | Representation |
---|---|
bin | 100011101011110101000… |
… | …1100000010111001010111 |
3 | 122100212100010000022102012 |
4 | 1013113222030002321113 |
5 | 1120323342044221441 |
6 | 14233031243134435 |
7 | 1014223516125266 |
oct | 107275214027127 |
9 | 18325303008365 |
10 | 4904486710871 |
11 | 1620a87985780 |
12 | 67263281441b |
13 | 29764cc87637 |
14 | 12d5425725dd |
15 | 8789c34c9eb |
hex | 475ea302e57 |
4904486710871 has 8 divisors (see below), whose sum is σ = 5350797648144. Its totient is φ = 4458250525120.
The previous prime is 4904486710831. The next prime is 4904486710939. The reversal of 4904486710871 is 1780176844094.
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-4904486710871 is a prime.
It is a super-2 number, since 2×49044867108712 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4904486710871.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4904486710801) 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, 18550646 + ... + 18813171.
It is an arithmetic number, because the mean of its divisors is an integer number (668849706018).
Almost surely, 24904486710871 is an apocalyptic number.
4904486710871 is a deficient number, since it is larger than the sum of its proper divisors (446310937273).
4904486710871 is a wasteful number, since it uses less digits than its factorization.
4904486710871 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37375761.
The product of its (nonzero) digits is 10838016, while the sum is 59.
The spelling of 4904486710871 in words is "four trillion, nine hundred four billion, four hundred eighty-six million, seven hundred ten thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •