Base | Representation |
---|---|
bin | 11001011110001000111010… |
… | …101001101010000100110001 |
3 | 112200122020012011022120122212 |
4 | 121132020322221222010301 |
5 | 104140333203134404131 |
6 | 1034130202133341505 |
7 | 32411226354511445 |
oct | 3136107251520461 |
9 | 480566164276585 |
10 | 112022321013041 |
11 | 3276a44388349a |
12 | 10692814797895 |
13 | 4a67876031b4a |
14 | 1d93ca3054825 |
15 | ce3e570cda2b |
hex | 65e23aa6a131 |
112022321013041 has 2 divisors, whose sum is σ = 112022321013042. Its totient is φ = 112022321013040.
The previous prime is 112022321012993. The next prime is 112022321013049. The reversal of 112022321013041 is 140310123220211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111776804727025 + 245516286016 = 10572455^2 + 495496^2 .
It is a cyclic number.
It is not a de Polignac number, because 112022321013041 - 242 = 107624274501937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112022321012998 and 112022321013016.
It is not a weakly prime, because it can be changed into another prime (112022321013049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56011160506520 + 56011160506521.
It is an arithmetic number, because the mean of its divisors is an integer number (56011160506521).
Almost surely, 2112022321013041 is an apocalyptic number.
It is an amenable number.
112022321013041 is a deficient number, since it is larger than the sum of its proper divisors (1).
112022321013041 is an equidigital number, since it uses as much as digits as its factorization.
112022321013041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 112022321013041 its reverse (140310123220211), we get a palindrome (252332444233252).
The spelling of 112022321013041 in words is "one hundred twelve trillion, twenty-two billion, three hundred twenty-one million, thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •