Base | Representation |
---|---|
bin | 1100000110000110… |
… | …01100101111011101 |
3 | 121202112220010200101 |
4 | 12003003030233131 |
5 | 101244331334323 |
6 | 2552204501101 |
7 | 316626604162 |
oct | 60303145735 |
9 | 17675803611 |
10 | 6493621213 |
11 | 2832530802 |
12 | 131284a791 |
13 | 7c6429621 |
14 | 4585c4069 |
15 | 280140dad |
hex | 1830ccbdd |
6493621213 has 2 divisors, whose sum is σ = 6493621214. Its totient is φ = 6493621212.
The previous prime is 6493621193. The next prime is 6493621219. The reversal of 6493621213 is 3121263946.
6493621213 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., 5660606169 + 833015044 = 75237^2 + 28862^2 .
It is a cyclic number.
It is not a de Polignac number, because 6493621213 - 29 = 6493620701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6493621219) 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, 3246810606 + 3246810607.
It is an arithmetic number, because the mean of its divisors is an integer number (3246810607).
Almost surely, 26493621213 is an apocalyptic number.
It is an amenable number.
6493621213 is a deficient number, since it is larger than the sum of its proper divisors (1).
6493621213 is an equidigital number, since it uses as much as digits as its factorization.
6493621213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 46656, while the sum is 37.
The square root of 6493621213 is about 80583.0082151318. The cubic root of 6493621213 is about 1865.6448941472.
The spelling of 6493621213 in words is "six billion, four hundred ninety-three million, six hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •