Base | Representation |
---|---|
bin | 11001011111100011111010… |
… | …000001111010111010100001 |
3 | 112200222120101001021100102002 |
4 | 121133203322001322322201 |
5 | 104143433300400232431 |
6 | 1034243120541333345 |
7 | 32421255433536605 |
oct | 3137437201727241 |
9 | 480876331240362 |
10 | 112120021102241 |
11 | 327a7919a49569 |
12 | 106a9740267255 |
13 | 4a73b461cac09 |
14 | 1d988d086b505 |
15 | ce67744633cb |
hex | 65f8fa07aea1 |
112120021102241 has 2 divisors, whose sum is σ = 112120021102242. Its totient is φ = 112120021102240.
The previous prime is 112120021102183. The next prime is 112120021102247. The reversal of 112120021102241 is 142201120021211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105412418373025 + 6707602729216 = 10267055^2 + 2589904^2 .
It is a cyclic number.
It is not a de Polignac number, because 112120021102241 - 222 = 112120016907937 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 (112120021102247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56060010551120 + 56060010551121.
It is an arithmetic number, because the mean of its divisors is an integer number (56060010551121).
Almost surely, 2112120021102241 is an apocalyptic number.
It is an amenable number.
112120021102241 is a deficient number, since it is larger than the sum of its proper divisors (1).
112120021102241 is an equidigital number, since it uses as much as digits as its factorization.
112120021102241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 112120021102241 its reverse (142201120021211), we get a palindrome (254321141123452).
The spelling of 112120021102241 in words is "one hundred twelve trillion, one hundred twenty billion, twenty-one million, one hundred two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •