Base | Representation |
---|---|
bin | 1011000001000001100010… |
… | …0100100001011110111101 |
3 | 1120212220202102210212201121 |
4 | 2300100120210201132331 |
5 | 3041421311310032422 |
6 | 41432135502110541 |
7 | 2360036050210465 |
oct | 260203044413675 |
9 | 46786672725647 |
10 | 12112220002237 |
11 | 394a844476503 |
12 | 1437519b7b451 |
13 | 69b23cb02584 |
14 | 2dc33d968ba5 |
15 | 1600eed868c7 |
hex | b04189217bd |
12112220002237 has 2 divisors, whose sum is σ = 12112220002238. Its totient is φ = 12112220002236.
The previous prime is 12112220002177. The next prime is 12112220002247. The reversal of 12112220002237 is 73220002221121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9978484947876 + 2133735054361 = 3158874^2 + 1460731^2 .
It is a cyclic number.
It is not a de Polignac number, because 12112220002237 - 27 = 12112220002109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12112220002247) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6056110001118 + 6056110001119.
It is an arithmetic number, because the mean of its divisors is an integer number (6056110001119).
Almost surely, 212112220002237 is an apocalyptic number.
It is an amenable number.
12112220002237 is a deficient number, since it is larger than the sum of its proper divisors (1).
12112220002237 is an equidigital number, since it uses as much as digits as its factorization.
12112220002237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 25.
Adding to 12112220002237 its reverse (73220002221121), we get a palindrome (85332222223358).
The spelling of 12112220002237 in words is "twelve trillion, one hundred twelve billion, two hundred twenty million, two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •