Base | Representation |
---|---|
bin | 1011000110110001111100… |
… | …0000011001100111100001 |
3 | 1121020101000101222010000021 |
4 | 2301230133000121213201 |
5 | 3100031324212034103 |
6 | 41545412453353441 |
7 | 2400136513204516 |
oct | 261543700314741 |
9 | 47211011863007 |
10 | 12211112221153 |
11 | 398878156224a |
12 | 1452718938881 |
13 | 6a766cc68741 |
14 | 30304182330d |
15 | 16298bbeebbd |
hex | b1b1f0199e1 |
12211112221153 has 2 divisors, whose sum is σ = 12211112221154. Its totient is φ = 12211112221152.
The previous prime is 12211112221039. The next prime is 12211112221159. The reversal of 12211112221153 is 35112221111221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6464697800929 + 5746414420224 = 2542577^2 + 2397168^2 .
It is a cyclic number.
It is not a de Polignac number, because 12211112221153 - 213 = 12211112212961 is a prime.
It is a super-2 number, since 2×122111122211532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12211112221159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105556110576 + 6105556110577.
It is an arithmetic number, because the mean of its divisors is an integer number (6105556110577).
Almost surely, 212211112221153 is an apocalyptic number.
It is an amenable number.
12211112221153 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211112221153 is an equidigital number, since it uses as much as digits as its factorization.
12211112221153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 480, while the sum is 25.
Adding to 12211112221153 its reverse (35112221111221), we get a palindrome (47323333332374).
The spelling of 12211112221153 in words is "twelve trillion, two hundred eleven billion, one hundred twelve million, two hundred twenty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •