Base | Representation |
---|---|
bin | 1011000000111001101001… |
… | …0100111111001000001101 |
3 | 1120212201021211102020001112 |
4 | 2300032122110333020031 |
5 | 3041402442103001031 |
6 | 41431145402021405 |
7 | 2356632421405325 |
oct | 260163224771015 |
9 | 46781254366045 |
10 | 12110102000141 |
11 | 3949957962152 |
12 | 14370287a7865 |
13 | 69ac930807b2 |
14 | 2dc1bc554285 |
15 | 160028e6562b |
hex | b039a53f20d |
12110102000141 has 2 divisors, whose sum is σ = 12110102000142. Its totient is φ = 12110102000140.
The previous prime is 12110102000057. The next prime is 12110102000153. The reversal of 12110102000141 is 14100020101121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9777059595241 + 2333042404900 = 3126829^2 + 1527430^2 .
It is a cyclic number.
It is not a de Polignac number, because 12110102000141 - 210 = 12110101999117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12110102000341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6055051000070 + 6055051000071.
It is an arithmetic number, because the mean of its divisors is an integer number (6055051000071).
Almost surely, 212110102000141 is an apocalyptic number.
It is an amenable number.
12110102000141 is a deficient number, since it is larger than the sum of its proper divisors (1).
12110102000141 is an equidigital number, since it uses as much as digits as its factorization.
12110102000141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12110102000141 its reverse (14100020101121), we get a palindrome (26210122101262).
The spelling of 12110102000141 in words is "twelve trillion, one hundred ten billion, one hundred two million, one hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •