Base | Representation |
---|---|
bin | 110100001110011001… |
… | …0011010010010110001 |
3 | 101201111002000100010012 |
4 | 1220130302122102301 |
5 | 3314141421023031 |
6 | 123304425144305 |
7 | 11050143230102 |
oct | 1503462322261 |
9 | 351432010105 |
10 | 112152126641 |
11 | 43621a51775 |
12 | 1989b62b095 |
13 | a764339119 |
14 | 55dcd5c3a9 |
15 | 2db6009b2b |
hex | 1a1cc9a4b1 |
112152126641 has 2 divisors, whose sum is σ = 112152126642. Its totient is φ = 112152126640.
The previous prime is 112152126617. The next prime is 112152126649. The reversal of 112152126641 is 146621251211.
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., 105022013041 + 7130113600 = 324071^2 + 84440^2 .
It is a cyclic number.
It is not a de Polignac number, because 112152126641 - 218 = 112151864497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112152126598 and 112152126607.
It is not a weakly prime, because it can be changed into another prime (112152126649) 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, 56076063320 + 56076063321.
It is an arithmetic number, because the mean of its divisors is an integer number (56076063321).
Almost surely, 2112152126641 is an apocalyptic number.
It is an amenable number.
112152126641 is a deficient number, since it is larger than the sum of its proper divisors (1).
112152126641 is an equidigital number, since it uses as much as digits as its factorization.
112152126641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5760, while the sum is 32.
Adding to 112152126641 its reverse (146621251211), we get a palindrome (258773377852).
The spelling of 112152126641 in words is "one hundred twelve billion, one hundred fifty-two million, one hundred twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •