Base | Representation |
---|---|
bin | 1100010110011011… |
… | …01111101100100101 |
3 | 122010002122120010112 |
4 | 12023031233230211 |
5 | 102034413303212 |
6 | 3013540502405 |
7 | 323212125464 |
oct | 61315575445 |
9 | 18102576115 |
10 | 6630603557 |
11 | 28a2891656 |
12 | 13506aaa05 |
13 | 81891b276 |
14 | 46c8809db |
15 | 28c19d422 |
hex | 18b36fb25 |
6630603557 has 2 divisors, whose sum is σ = 6630603558. Its totient is φ = 6630603556.
The previous prime is 6630603533. The next prime is 6630603563. The reversal of 6630603557 is 7553060366.
6630603557 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., 4225780036 + 2404823521 = 65006^2 + 49039^2 .
It is a cyclic number.
It is not a de Polignac number, because 6630603557 - 218 = 6630341413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6630603157) 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, 3315301778 + 3315301779.
It is an arithmetic number, because the mean of its divisors is an integer number (3315301779).
Almost surely, 26630603557 is an apocalyptic number.
It is an amenable number.
6630603557 is a deficient number, since it is larger than the sum of its proper divisors (1).
6630603557 is an equidigital number, since it uses as much as digits as its factorization.
6630603557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 340200, while the sum is 41.
The square root of 6630603557 is about 81428.5180818121. The cubic root of 6630603557 is about 1878.6722514423.
The spelling of 6630603557 in words is "six billion, six hundred thirty million, six hundred three thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •