Base | Representation |
---|---|
bin | 1011000110110001111110… |
… | …0110000101011110101101 |
3 | 1121020101001002120000102201 |
4 | 2301230133212011132231 |
5 | 3100031334224201031 |
6 | 41545413445221501 |
7 | 2400136663161316 |
oct | 261543746053655 |
9 | 47211032500381 |
10 | 12211122100141 |
11 | 398878709a4a8 |
12 | 1452720101891 |
13 | 6a76720171b3 |
14 | 303042c7560d |
15 | 16298ca01d61 |
hex | b1b1f9857ad |
12211122100141 has 2 divisors, whose sum is σ = 12211122100142. Its totient is φ = 12211122100140.
The previous prime is 12211122100103. The next prime is 12211122100159. The reversal of 12211122100141 is 14100122111221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10064413622916 + 2146708477225 = 3172446^2 + 1465165^2 .
It is a cyclic number.
It is not a de Polignac number, because 12211122100141 - 27 = 12211122100013 is a prime.
It is a super-2 number, since 2×122111221001412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12211122110141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105561050070 + 6105561050071.
It is an arithmetic number, because the mean of its divisors is an integer number (6105561050071).
Almost surely, 212211122100141 is an apocalyptic number.
It is an amenable number.
12211122100141 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211122100141 is an equidigital number, since it uses as much as digits as its factorization.
12211122100141 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 19.
Adding to 12211122100141 its reverse (14100122111221), we get a palindrome (26311244211362).
The spelling of 12211122100141 in words is "twelve trillion, two hundred eleven billion, one hundred twenty-two million, one hundred thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •