Base | Representation |
---|---|
bin | 1100110101001101… |
… | …10000110101011101 |
3 | 122210002112022120202 |
4 | 12122212300311131 |
5 | 103102014220221 |
6 | 3055323153245 |
7 | 332466001334 |
oct | 63246606535 |
9 | 18702468522 |
10 | 6888820061 |
11 | 2a15617522 |
12 | 1403075825 |
13 | 85a2797b6 |
14 | 494c98d1b |
15 | 2a4ba6d0b |
hex | 19a9b0d5d |
6888820061 has 8 divisors (see below), whose sum is σ = 7036862040. Its totient is φ = 6741447232.
The previous prime is 6888820013. The next prime is 6888820067. The reversal of 6888820061 is 1600288886.
It can be written as a sum of positive squares in 4 ways, for example, as 3191572036 + 3697248025 = 56494^2 + 60805^2 .
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-6888820061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6888819988 and 6888820015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6888820067) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 146450 + ... + 187683.
It is an arithmetic number, because the mean of its divisors is an integer number (879607755).
Almost surely, 26888820061 is an apocalyptic number.
It is an amenable number.
6888820061 is a deficient number, since it is larger than the sum of its proper divisors (148041979).
6888820061 is a wasteful number, since it uses less digits than its factorization.
6888820061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 334575.
The product of its (nonzero) digits is 294912, while the sum is 47.
The square root of 6888820061 is about 82998.9160230421. The cubic root of 6888820061 is about 1902.7494875373.
The spelling of 6888820061 in words is "six billion, eight hundred eighty-eight million, eight hundred twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •