Base | Representation |
---|---|
bin | 1011000110110101010100… |
… | …1111110001100110100101 |
3 | 1121020110100211021220102111 |
4 | 2301231111033301212211 |
5 | 3100040210142034341 |
6 | 41550043042041021 |
7 | 2400201203113114 |
oct | 261552517614645 |
9 | 47213324256374 |
10 | 12212022221221 |
11 | 39890a91a4819 |
12 | 1452931649171 |
13 | 6a7786653a14 |
14 | 3030ca623c7b |
15 | 1629e1a54681 |
hex | b1b553f19a5 |
12212022221221 has 2 divisors, whose sum is σ = 12212022221222. Its totient is φ = 12212022221220.
The previous prime is 12212022221207. The next prime is 12212022221281. The reversal of 12212022221221 is 12212222021221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11812900260100 + 399121961121 = 3436990^2 + 631761^2 .
It is a cyclic number.
It is not a de Polignac number, because 12212022221221 - 27 = 12212022221093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12212022221192 and 12212022221201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12212022221281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106011110610 + 6106011110611.
It is an arithmetic number, because the mean of its divisors is an integer number (6106011110611).
Almost surely, 212212022221221 is an apocalyptic number.
It is an amenable number.
12212022221221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212022221221 is an equidigital number, since it uses as much as digits as its factorization.
12212022221221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 12212022221221 its reverse (12212222021221), we get a palindrome (24424244242442).
The spelling of 12212022221221 in words is "twelve trillion, two hundred twelve billion, twenty-two million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •