Base | Representation |
---|---|
bin | 1010111011001100100100… |
… | …1000111001011001011001 |
3 | 1120112100100010012220121021 |
4 | 2232303021020321121121 |
5 | 3033301241344043111 |
6 | 41314141201442441 |
7 | 2346563053533106 |
oct | 256631110713131 |
9 | 46470303186537 |
10 | 12012103112281 |
11 | 3911339063238 |
12 | 1420039040421 |
13 | 69197601769c |
14 | 2d756319baad |
15 | 15c6e075cd71 |
hex | aecc9239659 |
12012103112281 has 2 divisors, whose sum is σ = 12012103112282. Its totient is φ = 12012103112280.
The previous prime is 12012103112213. The next prime is 12012103112311. The reversal of 12012103112281 is 18221130121021.
12012103112281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11974644993600 + 37458118681 = 3460440^2 + 193541^2 .
It is a cyclic number.
It is not a de Polignac number, because 12012103112281 - 27 = 12012103112153 is a prime.
It is a super-2 number, since 2×120121031122812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12012103112201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6006051556140 + 6006051556141.
It is an arithmetic number, because the mean of its divisors is an integer number (6006051556141).
Almost surely, 212012103112281 is an apocalyptic number.
It is an amenable number.
12012103112281 is a deficient number, since it is larger than the sum of its proper divisors (1).
12012103112281 is an equidigital number, since it uses as much as digits as its factorization.
12012103112281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 25.
The spelling of 12012103112281 in words is "twelve trillion, twelve billion, one hundred three million, one hundred twelve thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •