Base | Representation |
---|---|
bin | 1100010101001111… |
… | …01001000111011001 |
3 | 122002101212002120202 |
4 | 12022213221013121 |
5 | 102024334141004 |
6 | 3012542431545 |
7 | 323031204632 |
oct | 61247510731 |
9 | 18071762522 |
10 | 6620615129 |
11 | 289818a157 |
12 | 13492925b5 |
13 | 816831a5b |
14 | 46b400889 |
15 | 28b378b1e |
hex | 18a9e91d9 |
6620615129 has 2 divisors, whose sum is σ = 6620615130. Its totient is φ = 6620615128.
The previous prime is 6620615123. The next prime is 6620615143. The reversal of 6620615129 is 9215160266.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6343326025 + 277289104 = 79645^2 + 16652^2 .
It is a cyclic number.
It is not a de Polignac number, because 6620615129 - 232 = 2325647833 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 6620615092 and 6620615101.
It is not a weakly prime, because it can be changed into another prime (6620615123) 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, 3310307564 + 3310307565.
It is an arithmetic number, because the mean of its divisors is an integer number (3310307565).
Almost surely, 26620615129 is an apocalyptic number.
It is an amenable number.
6620615129 is a deficient number, since it is larger than the sum of its proper divisors (1).
6620615129 is an equidigital number, since it uses as much as digits as its factorization.
6620615129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 38.
The square root of 6620615129 is about 81367.1624735679. The cubic root of 6620615129 is about 1877.7284251950.
The spelling of 6620615129 in words is "six billion, six hundred twenty million, six hundred fifteen thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •