Base | Representation |
---|---|
bin | 1010111011101110001010… |
… | …1101010001000001011101 |
3 | 1120120012121122212110002122 |
4 | 2232323202231101001131 |
5 | 3033423224213324404 |
6 | 41322232140032325 |
7 | 2350332416106122 |
oct | 256734255210135 |
9 | 46505548773078 |
10 | 12021122011229 |
11 | 3915146a92531 |
12 | 14219355326a5 |
13 | 692782683b96 |
14 | 2d7b7acd2749 |
15 | 15ca6c41e3be |
hex | aeee2b5105d |
12021122011229 has 2 divisors, whose sum is σ = 12021122011230. Its totient is φ = 12021122011228.
The previous prime is 12021122011219. The next prime is 12021122011253. The reversal of 12021122011229 is 92211022112021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9913064844004 + 2108057167225 = 3148502^2 + 1451915^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12021122011229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12021122011198 and 12021122011207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12021122011219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6010561005614 + 6010561005615.
It is an arithmetic number, because the mean of its divisors is an integer number (6010561005615).
Almost surely, 212021122011229 is an apocalyptic number.
It is an amenable number.
12021122011229 is a deficient number, since it is larger than the sum of its proper divisors (1).
12021122011229 is an equidigital number, since it uses as much as digits as its factorization.
12021122011229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 12021122011229 in words is "twelve trillion, twenty-one billion, one hundred twenty-two million, eleven thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •