Base | Representation |
---|---|
bin | 1100110000110110… |
… | …01011010011111101 |
3 | 122200112200021012011 |
4 | 12120123023103331 |
5 | 103013132301344 |
6 | 3051535011221 |
7 | 331542660061 |
oct | 63033132375 |
9 | 18615607164 |
10 | 6852228349 |
11 | 29a69a463a |
12 | 13b2969b11 |
13 | 8528073b5 |
14 | 490091aa1 |
15 | 2a1879d34 |
hex | 1986cb4fd |
6852228349 has 2 divisors, whose sum is σ = 6852228350. Its totient is φ = 6852228348.
The previous prime is 6852228311. The next prime is 6852228377. The reversal of 6852228349 is 9438222586.
6852228349 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4743765625 + 2108462724 = 68875^2 + 45918^2 .
It is a cyclic number.
It is not a de Polignac number, because 6852228349 - 229 = 6315357437 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6852228049) 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, 3426114174 + 3426114175.
It is an arithmetic number, because the mean of its divisors is an integer number (3426114175).
Almost surely, 26852228349 is an apocalyptic number.
It is an amenable number.
6852228349 is a deficient number, since it is larger than the sum of its proper divisors (1).
6852228349 is an equidigital number, since it uses as much as digits as its factorization.
6852228349 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1658880, while the sum is 49.
The square root of 6852228349 is about 82778.1876402232. The cubic root of 6852228349 is about 1899.3745262517.
The spelling of 6852228349 in words is "six billion, eight hundred fifty-two million, two hundred twenty-eight thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •