Base | Representation |
---|---|
bin | 1100010110100010… |
… | …10001111101011001 |
3 | 122010011101122102102 |
4 | 12023101101331121 |
5 | 102040132432304 |
6 | 3014012413145 |
7 | 323223035444 |
oct | 61321217531 |
9 | 18104348372 |
10 | 6631530329 |
11 | 28a3364986 |
12 | 1350a771b5 |
13 | 818b84058 |
14 | 46ca4265b |
15 | 28c2d2d1e |
hex | 18b451f59 |
6631530329 has 2 divisors, whose sum is σ = 6631530330. Its totient is φ = 6631530328.
The previous prime is 6631530287. The next prime is 6631530331. The reversal of 6631530329 is 9230351366.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6600750025 + 30780304 = 81245^2 + 5548^2 .
It is a cyclic number.
It is not a de Polignac number, because 6631530329 - 212 = 6631526233 is a prime.
Together with 6631530331, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 6631530292 and 6631530301.
It is not a weakly prime, because it can be changed into another prime (6631530229) 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, 3315765164 + 3315765165.
It is an arithmetic number, because the mean of its divisors is an integer number (3315765165).
Almost surely, 26631530329 is an apocalyptic number.
It is an amenable number.
6631530329 is a deficient number, since it is larger than the sum of its proper divisors (1).
6631530329 is an equidigital number, since it uses as much as digits as its factorization.
6631530329 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 87480, while the sum is 38.
The square root of 6631530329 is about 81434.2085919670. The cubic root of 6631530329 is about 1878.7597758892.
The spelling of 6631530329 in words is "six billion, six hundred thirty-one million, five hundred thirty thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •