Base | Representation |
---|---|
bin | 1100100110000101… |
… | …00110100000010011 |
3 | 122110020201010001122 |
4 | 12103002212200103 |
5 | 102322021300201 |
6 | 3034550552455 |
7 | 326365126214 |
oct | 62302464023 |
9 | 18406633048 |
10 | 6761900051 |
11 | 295aa09655 |
12 | 138866872b |
13 | 839b9bbba |
14 | 48209b40b |
15 | 298985e1b |
hex | 1930a6813 |
6761900051 has 2 divisors, whose sum is σ = 6761900052. Its totient is φ = 6761900050.
The previous prime is 6761900029. The next prime is 6761900053. The reversal of 6761900051 is 1500091676.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 6761900051 - 230 = 5688158227 is a prime.
Together with 6761900053, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 6761899984 and 6761900020.
It is not a weakly prime, because it can be changed into another prime (6761900053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3380950025 + 3380950026.
It is an arithmetic number, because the mean of its divisors is an integer number (3380950026).
Almost surely, 26761900051 is an apocalyptic number.
6761900051 is a deficient number, since it is larger than the sum of its proper divisors (1).
6761900051 is an equidigital number, since it uses as much as digits as its factorization.
6761900051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 35.
The square root of 6761900051 is about 82230.7731387709. The cubic root of 6761900051 is about 1890.9915246613.
The spelling of 6761900051 in words is "six billion, seven hundred sixty-one million, nine hundred thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •