Base | Representation |
---|---|
bin | 1100110011100110… |
… | …10010111101001011 |
3 | 122202011010212102001 |
4 | 12121303102331023 |
5 | 103040041001311 |
6 | 3054122051431 |
7 | 332243220004 |
oct | 63163227513 |
9 | 18664125361 |
10 | 6875328331 |
11 | 2a08a41a33 |
12 | 13ba649b77 |
13 | 857534821 |
14 | 4931861ab |
15 | 2a38de4c1 |
hex | 199cd2f4b |
6875328331 has 2 divisors, whose sum is σ = 6875328332. Its totient is φ = 6875328330.
The previous prime is 6875328329. The next prime is 6875328407. The reversal of 6875328331 is 1338235786.
6875328331 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 6875328331 - 21 = 6875328329 is a prime.
It is a super-2 number, since 2×68753283312 = 94540279318102491122, which contains 22 as substring.
Together with 6875328329, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (6875328631) 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 as a sum of consecutive naturals, namely, 3437664165 + 3437664166.
It is an arithmetic number, because the mean of its divisors is an integer number (3437664166).
Almost surely, 26875328331 is an apocalyptic number.
6875328331 is a deficient number, since it is larger than the sum of its proper divisors (1).
6875328331 is an equidigital number, since it uses as much as digits as its factorization.
6875328331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 725760, while the sum is 46.
The square root of 6875328331 is about 82917.5996456723. The cubic root of 6875328331 is about 1901.5064996488.
The spelling of 6875328331 in words is "six billion, eight hundred seventy-five million, three hundred twenty-eight thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •