Base | Representation |
---|---|
bin | 101100100010010110100… |
… | …1010111001010100000101 |
3 | 210200011121000122020200212 |
4 | 1121010231022321110011 |
5 | 1300241441033241332 |
6 | 21003553241045205 |
7 | 1201143136316216 |
oct | 131045512712405 |
9 | 23604530566625 |
10 | 6121086227717 |
11 | 1a4aa3566552a |
12 | 82a383486805 |
13 | 3552a65b5256 |
14 | 1723954cb40d |
15 | a93544a38b2 |
hex | 5912d2b9505 |
6121086227717 has 2 divisors, whose sum is σ = 6121086227718. Its totient is φ = 6121086227716.
The previous prime is 6121086227689. The next prime is 6121086227719. The reversal of 6121086227717 is 7177226801216.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4842085824676 + 1279000403041 = 2200474^2 + 1130929^2 .
It is a cyclic number.
It is not a de Polignac number, because 6121086227717 - 212 = 6121086223621 is a prime.
Together with 6121086227719, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6121086227719) 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, 3060543113858 + 3060543113859.
It is an arithmetic number, because the mean of its divisors is an integer number (3060543113859).
Almost surely, 26121086227717 is an apocalyptic number.
It is an amenable number.
6121086227717 is a deficient number, since it is larger than the sum of its proper divisors (1).
6121086227717 is an equidigital number, since it uses as much as digits as its factorization.
6121086227717 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 790272, while the sum is 50.
The spelling of 6121086227717 in words is "six trillion, one hundred twenty-one billion, eighty-six million, two hundred twenty-seven thousand, seven hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •