Base | Representation |
---|---|
bin | 110001011111010010101… |
… | …0001100010010000001101 |
3 | 220002020101120221110202221 |
4 | 1202332211101202100031 |
5 | 1342414343223120312 |
6 | 22244354410215341 |
7 | 1301256421434304 |
oct | 142764521422015 |
9 | 26066346843687 |
10 | 6801706066957 |
11 | 219265083353a |
12 | 91a271724551 |
13 | 3a45238cb339 |
14 | 1972c097943b |
15 | bbddbe2b207 |
hex | 62fa546240d |
6801706066957 has 8 divisors (see below), whose sum is σ = 6803233802240. Its totient is φ = 6800178478320.
The previous prime is 6801706066921. The next prime is 6801706067021. The reversal of 6801706066957 is 7596606071086.
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 6801706066957 - 227 = 6801571849229 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6801706066895 and 6801706066904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6801706066907) 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, 183707107 + ... + 183744127.
It is an arithmetic number, because the mean of its divisors is an integer number (850404225280).
Almost surely, 26801706066957 is an apocalyptic number.
It is an amenable number.
6801706066957 is a deficient number, since it is larger than the sum of its proper divisors (1527735283).
6801706066957 is a wasteful number, since it uses less digits than its factorization.
6801706066957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73323.
The product of its (nonzero) digits is 22861440, while the sum is 61.
The spelling of 6801706066957 in words is "six trillion, eight hundred one billion, seven hundred six million, sixty-six thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •