Base | Representation |
---|---|
bin | 1011000001000001011101… |
… | …1100000010100100000101 |
3 | 1120212220201010001112020021 |
4 | 2300100113130002210011 |
5 | 3041421241424014341 |
6 | 41432133542535141 |
7 | 2360035426542106 |
oct | 260202734024405 |
9 | 46786633045207 |
10 | 12112201001221 |
11 | 394a834778792 |
12 | 14375137374b1 |
13 | 69b238baba79 |
14 | 2dc33b2203ad |
15 | 1600ed3819d1 |
hex | b0417702905 |
12112201001221 has 2 divisors, whose sum is σ = 12112201001222. Its totient is φ = 12112201001220.
The previous prime is 12112201001167. The next prime is 12112201001273. The reversal of 12112201001221 is 12210010221121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9489566504196 + 2622634497025 = 3080514^2 + 1619455^2 .
It is a cyclic number.
It is not a de Polignac number, because 12112201001221 - 219 = 12112200476933 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12112201001195 and 12112201001204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12112201001321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6056100500610 + 6056100500611.
It is an arithmetic number, because the mean of its divisors is an integer number (6056100500611).
Almost surely, 212112201001221 is an apocalyptic number.
It is an amenable number.
12112201001221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12112201001221 is an equidigital number, since it uses as much as digits as its factorization.
12112201001221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12112201001221 its reverse (12210010221121), we get a palindrome (24322211222342).
The spelling of 12112201001221 in words is "twelve trillion, one hundred twelve billion, two hundred one million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •