Base | Representation |
---|---|
bin | 1011000111010110110110… |
… | …1011101010100100011101 |
3 | 1121021022121001012010220002 |
4 | 2301311231223222210131 |
5 | 3100212123130321341 |
6 | 41554132101104045 |
7 | 2400640215023525 |
oct | 261655553524435 |
9 | 47238531163802 |
10 | 12221022120221 |
11 | 39919a7427082 |
12 | 14546236b8025 |
13 | 6a858c09a045 |
14 | 303701a10685 |
15 | 162d6bc1129b |
hex | b1d6daea91d |
12221022120221 has 2 divisors, whose sum is σ = 12221022120222. Its totient is φ = 12221022120220.
The previous prime is 12221022120173. The next prime is 12221022120247. The reversal of 12221022120221 is 12202122012221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11103963372121 + 1117058748100 = 3332261^2 + 1056910^2 .
It is a cyclic number.
It is not a de Polignac number, because 12221022120221 - 234 = 12203842251037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12221022120193 and 12221022120202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12221022126221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110511060110 + 6110511060111.
It is an arithmetic number, because the mean of its divisors is an integer number (6110511060111).
Almost surely, 212221022120221 is an apocalyptic number.
It is an amenable number.
12221022120221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12221022120221 is an equidigital number, since it uses as much as digits as its factorization.
12221022120221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 12221022120221 its reverse (12202122012221), we get a palindrome (24423144132442).
The spelling of 12221022120221 in words is "twelve trillion, two hundred twenty-one billion, twenty-two million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •