Base | Representation |
---|---|
bin | 101011110010000010110… |
… | …0010001101000010000101 |
3 | 210022020210220122011022202 |
4 | 1113210011202031002011 |
5 | 1242042004030042203 |
6 | 20444155003004245 |
7 | 1160511226241210 |
oct | 127440542150205 |
9 | 23266726564282 |
10 | 6017342034053 |
11 | 1a0aa387852a9 |
12 | 81224b809685 |
13 | 34858217a5cc |
14 | 16b3530a4777 |
15 | a67d16c3388 |
hex | 5790588d085 |
6017342034053 has 8 divisors (see below), whose sum is σ = 6964012481280. Its totient is φ = 5092434126000.
The previous prime is 6017342034017. The next prime is 6017342034083. The reversal of 6017342034053 is 3504302437106.
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-6017342034053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6017342033998 and 6017342034016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6017342034083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5440634198 + ... + 5440635303.
It is an arithmetic number, because the mean of its divisors is an integer number (870501560160).
Almost surely, 26017342034053 is an apocalyptic number.
It is an amenable number.
6017342034053 is a deficient number, since it is larger than the sum of its proper divisors (946670447227).
6017342034053 is a wasteful number, since it uses less digits than its factorization.
6017342034053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10881269587.
The product of its (nonzero) digits is 181440, while the sum is 38.
The spelling of 6017342034053 in words is "six trillion, seventeen billion, three hundred forty-two million, thirty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •