Base | Representation |
---|---|
bin | 1100110000011011… |
… | …11000100011001111 |
3 | 122200022010020001112 |
4 | 12120031320203033 |
5 | 103011234244011 |
6 | 3051332202235 |
7 | 331501234412 |
oct | 63015704317 |
9 | 18608106045 |
10 | 6848743631 |
11 | 29a4a34504 |
12 | 13b176937b |
13 | 851b87232 |
14 | 48d825b79 |
15 | 2a13dc58b |
hex | 1983788cf |
6848743631 has 2 divisors, whose sum is σ = 6848743632. Its totient is φ = 6848743630.
The previous prime is 6848743579. The next prime is 6848743633. The reversal of 6848743631 is 1363478486.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 6848743631 - 226 = 6781634767 is a prime.
It is a super-2 number, since 2×68487436312 = 93810578646326128322, which contains 22 as substring.
Together with 6848743633, 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 6848743631.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6848743633) 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, 3424371815 + 3424371816.
It is an arithmetic number, because the mean of its divisors is an integer number (3424371816).
Almost surely, 26848743631 is an apocalyptic number.
6848743631 is a deficient number, since it is larger than the sum of its proper divisors (1).
6848743631 is an equidigital number, since it uses as much as digits as its factorization.
6848743631 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2322432, while the sum is 50.
The square root of 6848743631 is about 82757.1364354761. The cubic root of 6848743631 is about 1899.0524944210.
The spelling of 6848743631 in words is "six billion, eight hundred forty-eight million, seven hundred forty-three thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •