Base | Representation |
---|---|
bin | 1011000111010011000101… |
… | …0111001100010000011101 |
3 | 1121021012222111221012212121 |
4 | 2301310301113030100131 |
5 | 3100203040042321341 |
6 | 41553443430302541 |
7 | 2400603146123311 |
oct | 261646127142035 |
9 | 47235874835777 |
10 | 12220010120221 |
11 | 3991528157542 |
12 | 14543a07b7a51 |
13 | 6a845a51ab87 |
14 | 30364745bb41 |
15 | 162d0ce5e4d1 |
hex | b1d315cc41d |
12220010120221 has 2 divisors, whose sum is σ = 12220010120222. Its totient is φ = 12220010120220.
The previous prime is 12220010120209. The next prime is 12220010120249. The reversal of 12220010120221 is 12202101002221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10292938644121 + 1927071476100 = 3208261^2 + 1388190^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12220010120221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12220010120195 and 12220010120204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220010120261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110005060110 + 6110005060111.
It is an arithmetic number, because the mean of its divisors is an integer number (6110005060111).
Almost surely, 212220010120221 is an apocalyptic number.
It is an amenable number.
12220010120221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220010120221 is an equidigital number, since it uses as much as digits as its factorization.
12220010120221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12220010120221 its reverse (12202101002221), we get a palindrome (24422111122442).
The spelling of 12220010120221 in words is "twelve trillion, two hundred twenty billion, ten million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •