Base | Representation |
---|---|
bin | 1100100111001111… |
… | …00111101001010011 |
3 | 122110220222010110001 |
4 | 12103213213221103 |
5 | 102332012312201 |
6 | 3035534550431 |
7 | 326543453602 |
oct | 62347475123 |
9 | 18426863401 |
10 | 6771604051 |
11 | 2965437393 |
12 | 138b968417 |
13 | 83bbb8b04 |
14 | 4834a5a39 |
15 | 299751301 |
hex | 1939e7a53 |
6771604051 has 2 divisors, whose sum is σ = 6771604052. Its totient is φ = 6771604050.
The previous prime is 6771604013. The next prime is 6771604117. The reversal of 6771604051 is 1504061776.
6771604051 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 6771604051 - 211 = 6771602003 is a prime.
It is a super-2 number, since 2×67716040512 = 91709242847039221202, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6771604051.
It is not a weakly prime, because it can be changed into another prime (6771614051) 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, 3385802025 + 3385802026.
It is an arithmetic number, because the mean of its divisors is an integer number (3385802026).
Almost surely, 26771604051 is an apocalyptic number.
6771604051 is a deficient number, since it is larger than the sum of its proper divisors (1).
6771604051 is an equidigital number, since it uses as much as digits as its factorization.
6771604051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35280, while the sum is 37.
The square root of 6771604051 is about 82289.7566590156. The cubic root of 6771604051 is about 1891.8956793366.
The spelling of 6771604051 in words is "six billion, seven hundred seventy-one million, six hundred four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •