Base | Representation |
---|---|
bin | 1011000000111001101110… |
… | …0001101111011110011101 |
3 | 1120212201100020021110211212 |
4 | 2300032123201233132131 |
5 | 3041403012230333432 |
6 | 41431151401154205 |
7 | 2356633054420136 |
oct | 260163341573635 |
9 | 46781306243755 |
10 | 12110122121117 |
11 | 3949968255359 |
12 | 143703348b965 |
13 | 69ac972a6cb7 |
14 | 2dc1c10b0c8d |
15 | 16002aadc2b2 |
hex | b039b86f79d |
12110122121117 has 2 divisors, whose sum is σ = 12110122121118. Its totient is φ = 12110122121116.
The previous prime is 12110122121113. The next prime is 12110122121179. The reversal of 12110122121117 is 71112122101121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8500600905241 + 3609521215876 = 2915579^2 + 1899874^2 .
It is a cyclic number.
It is not a de Polignac number, because 12110122121117 - 22 = 12110122121113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12110122121092 and 12110122121101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12110122121113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055061060558 + 6055061060559.
It is an arithmetic number, because the mean of its divisors is an integer number (6055061060559).
Almost surely, 212110122121117 is an apocalyptic number.
It is an amenable number.
12110122121117 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110122121117 is an equidigital number, since it uses as much as digits as its factorization.
12110122121117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 23.
Adding to 12110122121117 its reverse (71112122101121), we get a palindrome (83222244222238).
The spelling of 12110122121117 in words is "twelve trillion, one hundred ten billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •