Base | Representation |
---|---|
bin | 1011000000011011011101… |
… | …1110100101101110101101 |
3 | 1120211221101021011222122222 |
4 | 2300012313132211232231 |
5 | 3041234344241402341 |
6 | 41423325500045125 |
7 | 2356224604155413 |
oct | 260066736455655 |
9 | 46757337158588 |
10 | 12102001122221 |
11 | 394648015371a |
12 | 14355478337a5 |
13 | 69a2a197a3ca |
14 | 2dba5070b2b3 |
15 | 15ec02b9044b |
hex | b01b77a5bad |
12102001122221 has 2 divisors, whose sum is σ = 12102001122222. Its totient is φ = 12102001122220.
The previous prime is 12102001122191. The next prime is 12102001122257. The reversal of 12102001122221 is 12222110020121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11827305637225 + 274695484996 = 3439085^2 + 524114^2 .
It is a cyclic number.
It is not a de Polignac number, because 12102001122221 - 218 = 12102000860077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12102001122221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12102001122121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051000561110 + 6051000561111.
It is an arithmetic number, because the mean of its divisors is an integer number (6051000561111).
Almost surely, 212102001122221 is an apocalyptic number.
It is an amenable number.
12102001122221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12102001122221 is an equidigital number, since it uses as much as digits as its factorization.
12102001122221 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 17.
Adding to 12102001122221 its reverse (12222110020121), we get a palindrome (24324111142342).
The spelling of 12102001122221 in words is "twelve trillion, one hundred two billion, one million, one hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •