Base | Representation |
---|---|
bin | 1011000111010110110110… |
… | …1000001110110110011101 |
3 | 1121021022120222111102100221 |
4 | 2301311231220032312131 |
5 | 3100212122413022003 |
6 | 41554132025521341 |
7 | 2400640204254646 |
oct | 261655550166635 |
9 | 47238528442327 |
10 | 12221021220253 |
11 | 39919a69719aa |
12 | 1454623343251 |
13 | 6a858bb43511 |
14 | 3037018586cd |
15 | 162d6bad47bd |
hex | b1d6da0ed9d |
12221021220253 has 2 divisors, whose sum is σ = 12221021220254. Its totient is φ = 12221021220252.
The previous prime is 12221021220167. The next prime is 12221021220271. The reversal of 12221021220253 is 35202212012221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11897166897529 + 323854322724 = 3449227^2 + 569082^2 .
It is a cyclic number.
It is not a de Polignac number, because 12221021220253 - 233 = 12212431285661 is a prime.
It is a super-3 number, since 3×122210212202533 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12221021220293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110510610126 + 6110510610127.
It is an arithmetic number, because the mean of its divisors is an integer number (6110510610127).
Almost surely, 212221021220253 is an apocalyptic number.
It is an amenable number.
12221021220253 is a deficient number, since it is larger than the sum of its proper divisors (1).
12221021220253 is an equidigital number, since it uses as much as digits as its factorization.
12221021220253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 12221021220253 its reverse (35202212012221), we get a palindrome (47423233232474).
The spelling of 12221021220253 in words is "twelve trillion, two hundred twenty-one billion, twenty-one million, two hundred twenty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •