Base | Representation |
---|---|
bin | 1100110101010101… |
… | …00110111011011001 |
3 | 122210011102112021221 |
4 | 12122222212323121 |
5 | 103102243444212 |
6 | 3055400532041 |
7 | 332510400160 |
oct | 63252467331 |
9 | 18704375257 |
10 | 6889828057 |
11 | 2a16145882 |
12 | 1403481021 |
13 | 85a540548 |
14 | 49507c3d7 |
15 | 2a4d05807 |
hex | 19aaa6ed9 |
6889828057 has 4 divisors (see below), whose sum is σ = 7874089216. Its totient is φ = 5905566900.
The previous prime is 6889828039. The next prime is 6889828069. The reversal of 6889828057 is 7508289886.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 6889828057 - 219 = 6889303769 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6889827986 and 6889828004.
It is not an unprimeable number, because it can be changed into a prime (6889828007) 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 3 ways as a sum of consecutive naturals, for example, 492130569 + ... + 492130582.
It is an arithmetic number, because the mean of its divisors is an integer number (1968522304).
Almost surely, 26889828057 is an apocalyptic number.
It is an amenable number.
6889828057 is a deficient number, since it is larger than the sum of its proper divisors (984261159).
6889828057 is an equidigital number, since it uses as much as digits as its factorization.
6889828057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 984261158.
The product of its (nonzero) digits is 15482880, while the sum is 61.
The square root of 6889828057 is about 83004.9881452916. The cubic root of 6889828057 is about 1902.8422886419.
The spelling of 6889828057 in words is "six billion, eight hundred eighty-nine million, eight hundred twenty-eight thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •