Base | Representation |
---|---|
bin | 101100100010101001001… |
… | …1110110011000110111101 |
3 | 210200020012122112001012222 |
4 | 1121011102132303012331 |
5 | 1300244231310432143 |
6 | 21004135321535125 |
7 | 1201164510106511 |
oct | 131052236630675 |
9 | 23606178461188 |
10 | 6121712202173 |
11 | 1a50226a44397 |
12 | 82a5190444a5 |
13 | 3553761a6739 |
14 | 1724146b6141 |
15 | a938e402768 |
hex | 591527b31bd |
6121712202173 has 2 divisors, whose sum is σ = 6121712202174. Its totient is φ = 6121712202172.
The previous prime is 6121712202167. The next prime is 6121712202223. The reversal of 6121712202173 is 3712022171216.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6103454247289 + 18257954884 = 2470517^2 + 135122^2 .
It is a cyclic number.
It is not a de Polignac number, because 6121712202173 - 210 = 6121712201149 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6121712232173) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3060856101086 + 3060856101087.
It is an arithmetic number, because the mean of its divisors is an integer number (3060856101087).
Almost surely, 26121712202173 is an apocalyptic number.
It is an amenable number.
6121712202173 is a deficient number, since it is larger than the sum of its proper divisors (1).
6121712202173 is an equidigital number, since it uses as much as digits as its factorization.
6121712202173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14112, while the sum is 35.
Adding to 6121712202173 its reverse (3712022171216), we get a palindrome (9833734373389).
The spelling of 6121712202173 in words is "six trillion, one hundred twenty-one billion, seven hundred twelve million, two hundred two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •