Base | Representation |
---|---|
bin | 101010100100000010010… |
… | …1010110111111010000001 |
3 | 202201020102021112102000001 |
4 | 1111020010222313322001 |
5 | 1231320414343230212 |
6 | 20235212202000001 |
7 | 1142431041630061 |
oct | 125100452677201 |
9 | 22636367472001 |
10 | 5849823805057 |
11 | 1955995040451 |
12 | 7a589a1a6001 |
13 | 33583643c69b |
14 | 1631c0c953a1 |
15 | a2279ba2657 |
hex | 55204ab7e81 |
5849823805057 has 8 divisors (see below), whose sum is σ = 5850896174784. Its totient is φ = 5848751552688.
The previous prime is 5849823805039. The next prime is 5849823805079. The reversal of 5849823805057 is 7505083289485.
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-5849823805057 is a prime.
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 5849823805057.
It is not an unprimeable number, because it can be changed into a prime (5849823805157) 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, 217427868 + ... + 217454770.
It is an arithmetic number, because the mean of its divisors is an integer number (731362021848).
Almost surely, 25849823805057 is an apocalyptic number.
It is an amenable number.
5849823805057 is a deficient number, since it is larger than the sum of its proper divisors (1072369727).
5849823805057 is a wasteful number, since it uses less digits than its factorization.
5849823805057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58679.
The product of its (nonzero) digits is 96768000, while the sum is 64.
The spelling of 5849823805057 in words is "five trillion, eight hundred forty-nine billion, eight hundred twenty-three million, eight hundred five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •