Base | Representation |
---|---|
bin | 1011000001011110111011… |
… | …1110111010010010101101 |
3 | 1120220200010110101122000012 |
4 | 2300113232332322102231 |
5 | 3042033442211223432 |
6 | 41435522551343005 |
7 | 2360435451656021 |
oct | 260275676722255 |
9 | 46820113348005 |
10 | 12120112211117 |
11 | 3953124410889 |
12 | 1438b61081a65 |
13 | 69bbc9c04861 |
14 | 2dc88bbb4381 |
15 | 160412b8dcb2 |
hex | b05eefba4ad |
12120112211117 has 2 divisors, whose sum is σ = 12120112211118. Its totient is φ = 12120112211116.
The previous prime is 12120112211089. The next prime is 12120112211183. The reversal of 12120112211117 is 71111221102121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6296742067561 + 5823370143556 = 2509331^2 + 2413166^2 .
It is a cyclic number.
It is not a de Polignac number, because 12120112211117 - 232 = 12115817243821 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12120112211092 and 12120112211101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12120112216117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6060056105558 + 6060056105559.
It is an arithmetic number, because the mean of its divisors is an integer number (6060056105559).
Almost surely, 212120112211117 is an apocalyptic number.
It is an amenable number.
12120112211117 is a deficient number, since it is larger than the sum of its proper divisors (1).
12120112211117 is an equidigital number, since it uses as much as digits as its factorization.
12120112211117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 23.
Adding to 12120112211117 its reverse (71111221102121), we get a palindrome (83231333313238).
The spelling of 12120112211117 in words is "twelve trillion, one hundred twenty billion, one hundred twelve million, two hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •