Base | Representation |
---|---|
bin | 1011000001000001001000… |
… | …0001101111011111001101 |
3 | 1120212220110210020102112112 |
4 | 2300100102001233133031 |
5 | 3041421100204040021 |
6 | 41432120541113405 |
7 | 2360033245120361 |
oct | 260202201573715 |
9 | 46786423212475 |
10 | 12112110221261 |
11 | 394a798504426 |
12 | 14374a9258865 |
13 | 69b223145b0b |
14 | 2dc32d14d2a1 |
15 | 1600e53edd5b |
hex | b041206f7cd |
12112110221261 has 2 divisors, whose sum is σ = 12112110221262. Its totient is φ = 12112110221260.
The previous prime is 12112110221131. The next prime is 12112110221273. The reversal of 12112110221261 is 16212201121121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11448789563236 + 663320658025 = 3383606^2 + 814445^2 .
It is an emirp because it is prime and its reverse (16212201121121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12112110221261 - 214 = 12112110204877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12112110241261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6056055110630 + 6056055110631.
It is an arithmetic number, because the mean of its divisors is an integer number (6056055110631).
Almost surely, 212112110221261 is an apocalyptic number.
It is an amenable number.
12112110221261 is a deficient number, since it is larger than the sum of its proper divisors (1).
12112110221261 is an equidigital number, since it uses as much as digits as its factorization.
12112110221261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 12112110221261 its reverse (16212201121121), we get a palindrome (28324311342382).
The spelling of 12112110221261 in words is "twelve trillion, one hundred twelve billion, one hundred ten million, two hundred twenty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •