Base | Representation |
---|---|
bin | 1100011101100100… |
… | …11111011101111101 |
3 | 122021021111001222002 |
4 | 12032302133131331 |
5 | 102200241134221 |
6 | 3023522032045 |
7 | 324540614222 |
oct | 61662373575 |
9 | 18237431862 |
10 | 6690568061 |
11 | 29237188a1 |
12 | 13687a8625 |
13 | 828185018 |
14 | 47680d949 |
15 | 29259580b |
hex | 18ec9f77d |
6690568061 has 4 divisors (see below), whose sum is σ = 6690903900. Its totient is φ = 6690232224.
The previous prime is 6690568043. The next prime is 6690568103. The reversal of 6690568061 is 1608650966.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1302127225 + 5388440836 = 36085^2 + 73406^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6690568061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6690567997 and 6690568015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6690568361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 136016 + ... + 178553.
It is an arithmetic number, because the mean of its divisors is an integer number (1672725975).
Almost surely, 26690568061 is an apocalyptic number.
It is an amenable number.
6690568061 is a deficient number, since it is larger than the sum of its proper divisors (335839).
6690568061 is a wasteful number, since it uses less digits than its factorization.
6690568061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 335838.
The product of its (nonzero) digits is 466560, while the sum is 47.
The square root of 6690568061 is about 81795.8926902812. The cubic root of 6690568061 is about 1884.3185824644.
The spelling of 6690568061 in words is "six billion, six hundred ninety million, five hundred sixty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •