Base | Representation |
---|---|
bin | 1100110100011000… |
… | …10100100000000001 |
3 | 122202121111010221021 |
4 | 12122030110200001 |
5 | 103043230411012 |
6 | 3054514425441 |
7 | 332353041106 |
oct | 63214244001 |
9 | 18677433837 |
10 | 6881888257 |
11 | 2a11712562 |
12 | 1400892281 |
13 | 8589c063a |
14 | 493db2aad |
15 | 2a4288007 |
hex | 19a314801 |
6881888257 has 8 divisors (see below), whose sum is σ = 6952146336. Its totient is φ = 6811920672.
The previous prime is 6881888227. The next prime is 6881888309. The reversal of 6881888257 is 7528881886.
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-6881888257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6881888195 and 6881888204.
It is not an unprimeable number, because it can be changed into a prime (6881888227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 24843 + ... + 119920.
It is an arithmetic number, because the mean of its divisors is an integer number (869018292).
Almost surely, 26881888257 is an apocalyptic number.
It is an amenable number.
6881888257 is a deficient number, since it is larger than the sum of its proper divisors (70258079).
6881888257 is a wasteful number, since it uses less digits than its factorization.
6881888257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145247.
The product of its digits is 13762560, while the sum is 61.
The square root of 6881888257 is about 82957.1471122290. The cubic root of 6881888257 is about 1902.1110660179. Note that the first 3 decimals are identical.
The spelling of 6881888257 in words is "six billion, eight hundred eighty-one million, eight hundred eighty-eight thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •