Base | Representation |
---|---|
bin | 1100110010110011… |
… | …11000011011001101 |
3 | 122201200121101111022 |
4 | 12121121320123031 |
5 | 103031334303221 |
6 | 3053323203525 |
7 | 332132461325 |
oct | 63131703315 |
9 | 18650541438 |
10 | 6868666061 |
11 | 2a05201524 |
12 | 13b83765a5 |
13 | 85604125a |
14 | 492330285 |
15 | 2a30254ab |
hex | 1996786cd |
6868666061 has 2 divisors, whose sum is σ = 6868666062. Its totient is φ = 6868666060.
The previous prime is 6868666033. The next prime is 6868666097. The reversal of 6868666061 is 1606668686.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4468254025 + 2400412036 = 66845^2 + 48994^2 .It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 1909998989 and 9898999091.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6868666061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6868665994 and 6868666012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6868686061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3434333030 + 3434333031.
It is an arithmetic number, because the mean of its divisors is an integer number (3434333031).
Almost surely, 26868666061 is an apocalyptic number.
It is an amenable number.
6868666061 is a deficient number, since it is larger than the sum of its proper divisors (1).
6868666061 is an equidigital number, since it uses as much as digits as its factorization.
6868666061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2985984, while the sum is 53.
The square root of 6868666061 is about 82877.4158682569. The cubic root of 6868666061 is about 1900.8921074711.
The spelling of 6868666061 in words is "six billion, eight hundred sixty-eight million, six hundred sixty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •