Base | Representation |
---|---|
bin | 1100000110001111… |
… | …00000110110111101 |
3 | 121202122000121002101 |
4 | 12003013200312331 |
5 | 101300124032224 |
6 | 2552245025101 |
7 | 316642324402 |
oct | 60307406675 |
9 | 17678017071 |
10 | 6494752189 |
11 | 28331334a2 |
12 | 13130b5191 |
13 | 7c6734343 |
14 | 4587da2a9 |
15 | 2802b6044 |
hex | 1831e0dbd |
6494752189 has 2 divisors, whose sum is σ = 6494752190. Its totient is φ = 6494752188.
The previous prime is 6494752163. The next prime is 6494752211. The reversal of 6494752189 is 9812574946.
6494752189 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., 6482987289 + 11764900 = 80517^2 + 3430^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6494752189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6494756189) 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, 3247376094 + 3247376095.
It is an arithmetic number, because the mean of its divisors is an integer number (3247376095).
Almost surely, 26494752189 is an apocalyptic number.
It is an amenable number.
6494752189 is a deficient number, since it is larger than the sum of its proper divisors (1).
6494752189 is an equidigital number, since it uses as much as digits as its factorization.
6494752189 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4354560, while the sum is 55.
The square root of 6494752189 is about 80590.0253691485. The cubic root of 6494752189 is about 1865.7531992590.
The spelling of 6494752189 in words is "six billion, four hundred ninety-four million, seven hundred fifty-two thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •