Base | Representation |
---|---|
bin | 1011000110110101001111… |
… | …1111001110011011100101 |
3 | 1121020110022100120010021211 |
4 | 2301231103333032123211 |
5 | 3100040134240340022 |
6 | 41550041005311421 |
7 | 2400200525456464 |
oct | 261552377163345 |
9 | 47213270503254 |
10 | 12212001105637 |
11 | 3989098292323 |
12 | 1452926565571 |
13 | 6a778216c8a8 |
14 | 3030c78c89db |
15 | 1629dec82e77 |
hex | b1b53fce6e5 |
12212001105637 has 2 divisors, whose sum is σ = 12212001105638. Its totient is φ = 12212001105636.
The previous prime is 12212001105593. The next prime is 12212001105727. The reversal of 12212001105637 is 73650110021221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12160347634561 + 51653471076 = 3487169^2 + 227274^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12212001105637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12212001105599 and 12212001105608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12212091105637) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106000552818 + 6106000552819.
It is an arithmetic number, because the mean of its divisors is an integer number (6106000552819).
Almost surely, 212212001105637 is an apocalyptic number.
It is an amenable number.
12212001105637 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212001105637 is an equidigital number, since it uses as much as digits as its factorization.
12212001105637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 31.
Adding to 12212001105637 its reverse (73650110021221), we get a palindrome (85862111126858).
The spelling of 12212001105637 in words is "twelve trillion, two hundred twelve billion, one million, one hundred five thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •