Base | Representation |
---|---|
bin | 1011000000100111011001… |
… | …0110101100010010111001 |
3 | 1120212020122110000122102102 |
4 | 2300021312112230102321 |
5 | 3041312424044001332 |
6 | 41425015334113145 |
7 | 2356400141011412 |
oct | 260116626542271 |
9 | 46766573018372 |
10 | 12105203500217 |
11 | 3947873880703 |
12 | 14360a01ab7b5 |
13 | 69a69226c429 |
14 | 2dbc75b54809 |
15 | 15ed3ddad062 |
hex | b02765ac4b9 |
12105203500217 has 2 divisors, whose sum is σ = 12105203500218. Its totient is φ = 12105203500216.
The previous prime is 12105203500211. The next prime is 12105203500321. The reversal of 12105203500217 is 71200530250121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7929315337216 + 4175888163001 = 2815904^2 + 2043499^2 .
It is a cyclic number.
It is not a de Polignac number, because 12105203500217 - 212 = 12105203496121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12105203500217.
It is not a weakly prime, because it can be changed into another prime (12105203500211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6052601750108 + 6052601750109.
It is an arithmetic number, because the mean of its divisors is an integer number (6052601750109).
Almost surely, 212105203500217 is an apocalyptic number.
It is an amenable number.
12105203500217 is a deficient number, since it is larger than the sum of its proper divisors (1).
12105203500217 is an equidigital number, since it uses as much as digits as its factorization.
12105203500217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4200, while the sum is 29.
Adding to 12105203500217 its reverse (71200530250121), we get a palindrome (83305733750338).
The spelling of 12105203500217 in words is "twelve trillion, one hundred five billion, two hundred three million, five hundred thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •