Base | Representation |
---|---|
bin | 1100110011000110… |
… | …11011100010000111 |
3 | 122201212022120002122 |
4 | 12121203123202013 |
5 | 103033004403114 |
6 | 3053453000155 |
7 | 332162655101 |
oct | 63143334207 |
9 | 18655276078 |
10 | 6871169159 |
11 | 2a066610a8 |
12 | 13b918305b |
13 | 85670968a |
14 | 4927c2571 |
15 | 2a336be8e |
hex | 1998db887 |
6871169159 has 2 divisors, whose sum is σ = 6871169160. Its totient is φ = 6871169158.
The previous prime is 6871169147. The next prime is 6871169161. The reversal of 6871169159 is 9519611786.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 6871169159 - 28 = 6871168903 is a prime.
It is a super-2 number, since 2×68711691592 = 94425931223185534562, which contains 22 as substring.
Together with 6871169161, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 6871169159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6871169959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3435584579 + 3435584580.
It is an arithmetic number, because the mean of its divisors is an integer number (3435584580).
Almost surely, 26871169159 is an apocalyptic number.
6871169159 is a deficient number, since it is larger than the sum of its proper divisors (1).
6871169159 is an equidigital number, since it uses as much as digits as its factorization.
6871169159 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 816480, while the sum is 53.
The square root of 6871169159 is about 82892.5156995491. The cubic root of 6871169159 is about 1901.1229888542.
The spelling of 6871169159 in words is "six billion, eight hundred seventy-one million, one hundred sixty-nine thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •