Base | Representation |
---|---|
bin | 10000010100001000000… |
… | …001111110011111110101 |
3 | 10222011210212022220101202 |
4 | 100110020001332133311 |
5 | 121332024011400432 |
6 | 2215011434102245 |
7 | 143666266652312 |
oct | 20241001763765 |
9 | 3864725286352 |
10 | 1121121200117 |
11 | 3a2512765286 |
12 | 16134527a985 |
13 | 8194b847319 |
14 | 3c396649d09 |
15 | 1e269d8e462 |
hex | 1050807e7f5 |
1121121200117 has 2 divisors, whose sum is σ = 1121121200118. Its totient is φ = 1121121200116.
The previous prime is 1121121200081. The next prime is 1121121200131. The reversal of 1121121200117 is 7110021211211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1119545983396 + 1575216721 = 1058086^2 + 39689^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1121121200117 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121121200417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560560600058 + 560560600059.
It is an arithmetic number, because the mean of its divisors is an integer number (560560600059).
Almost surely, 21121121200117 is an apocalyptic number.
It is an amenable number.
1121121200117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121121200117 is an equidigital number, since it uses as much as digits as its factorization.
1121121200117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 1121121200117 its reverse (7110021211211), we get a palindrome (8231142411328).
The spelling of 1121121200117 in words is "one trillion, one hundred twenty-one billion, one hundred twenty-one million, two hundred thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •