Base | Representation |
---|---|
bin | 101101110100101100000… |
… | …0110000100101001100101 |
3 | 211022001222111000200222201 |
4 | 1123221120012010221211 |
5 | 1311141044402332403 |
6 | 21221114302454501 |
7 | 1220002556045506 |
oct | 133513006045145 |
9 | 24261874020881 |
10 | 6297900042853 |
11 | 2008a1942a881 |
12 | 8586a9b94431 |
13 | 368b740b71c3 |
14 | 17ab6a096bad |
15 | adc520dc21d |
hex | 5ba58184a65 |
6297900042853 has 8 divisors (see below), whose sum is σ = 6377939089280. Its totient is φ = 6217868966400.
The previous prime is 6297900042821. The next prime is 6297900042881. The reversal of 6297900042853 is 3582400097926.
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 6297900042853 - 25 = 6297900042821 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6297900042794 and 6297900042803.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6297900042253) 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, 393948 + ... + 3570853.
It is an arithmetic number, because the mean of its divisors is an integer number (797242386160).
Almost surely, 26297900042853 is an apocalyptic number.
It is an amenable number.
6297900042853 is a deficient number, since it is larger than the sum of its proper divisors (80039046427).
6297900042853 is a wasteful number, since it uses less digits than its factorization.
6297900042853 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3984987.
The product of its (nonzero) digits is 6531840, while the sum is 55.
The spelling of 6297900042853 in words is "six trillion, two hundred ninety-seven billion, nine hundred million, forty-two thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •