Base | Representation |
---|---|
bin | 10000010100000101111… |
… | …011001011100011000101 |
3 | 10222011201101211122112121 |
4 | 100110011323023203011 |
5 | 121331440440123013 |
6 | 2215004132445541 |
7 | 143665360421044 |
oct | 20240573134305 |
9 | 3864641748477 |
10 | 1121085864133 |
11 | 3a24a481a894 |
12 | 1613354798b1 |
13 | 81944424661 |
14 | 3c391a8c55b |
15 | 1e266c0e58d |
hex | 10505ecb8c5 |
1121085864133 has 2 divisors, whose sum is σ = 1121085864134. Its totient is φ = 1121085864132.
The previous prime is 1121085864127. The next prime is 1121085864139. The reversal of 1121085864133 is 3314685801211.
It is a balanced prime because it is at equal distance from previous prime (1121085864127) and next prime (1121085864139).
It can be written as a sum of positive squares in only one way, i.e., 588299738049 + 532786126084 = 767007^2 + 729922^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121085864133 - 213 = 1121085855941 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1121085864133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121085864139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560542932066 + 560542932067.
It is an arithmetic number, because the mean of its divisors is an integer number (560542932067).
Almost surely, 21121085864133 is an apocalyptic number.
It is an amenable number.
1121085864133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121085864133 is an equidigital number, since it uses as much as digits as its factorization.
1121085864133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 138240, while the sum is 43.
The spelling of 1121085864133 in words is "one trillion, one hundred twenty-one billion, eighty-five million, eight hundred sixty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •