Base | Representation |
---|---|
bin | 1011000110101110100111… |
… | …1001000011010001001001 |
3 | 1121020021201022011120112212 |
4 | 2301223221321003101021 |
5 | 3100023013100232103 |
6 | 41545144221514505 |
7 | 2400105442625114 |
oct | 261535171032111 |
9 | 47207638146485 |
10 | 12210221102153 |
11 | 3988364546368 |
12 | 145250a412a35 |
13 | 6a755a4614a9 |
14 | 302d9933957b |
15 | 1629388797d8 |
hex | b1ae9e43449 |
12210221102153 has 2 divisors, whose sum is σ = 12210221102154. Its totient is φ = 12210221102152.
The previous prime is 12210221102089. The next prime is 12210221102161. The reversal of 12210221102153 is 35120112201221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12203654917129 + 6566185024 = 3493373^2 + 81032^2 .
It is a cyclic number.
It is not a de Polignac number, because 12210221102153 - 26 = 12210221102089 is a prime.
It is a super-2 number, since 2×122102211021532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12210221102353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105110551076 + 6105110551077.
It is an arithmetic number, because the mean of its divisors is an integer number (6105110551077).
Almost surely, 212210221102153 is an apocalyptic number.
It is an amenable number.
12210221102153 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210221102153 is an equidigital number, since it uses as much as digits as its factorization.
12210221102153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 12210221102153 its reverse (35120112201221), we get a palindrome (47330333303374).
The spelling of 12210221102153 in words is "twelve trillion, two hundred ten billion, two hundred twenty-one million, one hundred two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •