Base | Representation |
---|---|
bin | 10000010100000111010… |
… | …111100000010010111001 |
3 | 10222011210002101020202102 |
4 | 100110013113200102321 |
5 | 121332013134110421 |
6 | 2215010355313145 |
7 | 143666103221345 |
oct | 20240727402271 |
9 | 3864702336672 |
10 | 1121110066361 |
11 | 3a250745032a |
12 | 1613415ab7b5 |
13 | 819494496bc |
14 | 3c394d8c625 |
15 | 1e268de060b |
hex | 105075e04b9 |
1121110066361 has 2 divisors, whose sum is σ = 1121110066362. Its totient is φ = 1121110066360.
The previous prime is 1121110066357. The next prime is 1121110066369. The reversal of 1121110066361 is 1636600111211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1019960624761 + 101149441600 = 1009931^2 + 318040^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121110066361 - 22 = 1121110066357 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1121110066369) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560555033180 + 560555033181.
It is an arithmetic number, because the mean of its divisors is an integer number (560555033181).
Almost surely, 21121110066361 is an apocalyptic number.
It is an amenable number.
1121110066361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121110066361 is an equidigital number, since it uses as much as digits as its factorization.
1121110066361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 29.
Adding to 1121110066361 its reverse (1636600111211), we get a palindrome (2757710177572).
The spelling of 1121110066361 in words is "one trillion, one hundred twenty-one billion, one hundred ten million, sixty-six thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •