Base | Representation |
---|---|
bin | 10000010100000110110… |
… | …101101110011001111101 |
3 | 10222011202110201100211202 |
4 | 100110012311232121331 |
5 | 121332003402230021 |
6 | 2215005441425245 |
7 | 143665635030623 |
oct | 20240665563175 |
9 | 3864673640752 |
10 | 1121101211261 |
11 | 3a2502452369 |
12 | 16133a63b225 |
13 | 81947668cb5 |
14 | 3c393b25513 |
15 | 1e268241a0b |
hex | 10506d6e67d |
1121101211261 has 2 divisors, whose sum is σ = 1121101211262. Its totient is φ = 1121101211260.
The previous prime is 1121101211189. The next prime is 1121101211281. The reversal of 1121101211261 is 1621121011211.
It is an a-pointer prime, because the next prime (1121101211281) can be obtained adding 1121101211261 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 856281876025 + 264819335236 = 925355^2 + 514606^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121101211261 - 222 = 1121097016957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121101211281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560550605630 + 560550605631.
It is an arithmetic number, because the mean of its divisors is an integer number (560550605631).
Almost surely, 21121101211261 is an apocalyptic number.
It is an amenable number.
1121101211261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121101211261 is an equidigital number, since it uses as much as digits as its factorization.
1121101211261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 20.
Adding to 1121101211261 its reverse (1621121011211), we get a palindrome (2742222222472).
The spelling of 1121101211261 in words is "one trillion, one hundred twenty-one billion, one hundred one million, two hundred eleven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •