Base | Representation |
---|---|
bin | 1011000110101101110011… |
… | …0110000010000111000101 |
3 | 1121020021011001021120002101 |
4 | 2301223130312002013011 |
5 | 3100022041031112143 |
6 | 41545110402112101 |
7 | 2400100144223251 |
oct | 261533466020705 |
9 | 47207131246071 |
10 | 12210002207173 |
11 | 3988261a28321 |
12 | 145246904b631 |
13 | 6a7523cbca34 |
14 | 302d78239261 |
15 | 16292453bb4d |
hex | b1adcd821c5 |
12210002207173 has 2 divisors, whose sum is σ = 12210002207174. Its totient is φ = 12210002207172.
The previous prime is 12210002207159. The next prime is 12210002207237. The reversal of 12210002207173 is 37170220001221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10227856402404 + 1982145804769 = 3198102^2 + 1407887^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12210002207173 is a prime.
It is a super-2 number, since 2×122100022071732 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12210002207113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105001103586 + 6105001103587.
It is an arithmetic number, because the mean of its divisors is an integer number (6105001103587).
Almost surely, 212210002207173 is an apocalyptic number.
It is an amenable number.
12210002207173 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210002207173 is an equidigital number, since it uses as much as digits as its factorization.
12210002207173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2352, while the sum is 28.
Adding to 12210002207173 its reverse (37170220001221), we get a palindrome (49380222208394).
The spelling of 12210002207173 in words is "twelve trillion, two hundred ten billion, two million, two hundred seven thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •