Base | Representation |
---|---|
bin | 110100010100000111… |
… | …0110111000110010001 |
3 | 101201222110022022202002 |
4 | 1220220032313012101 |
5 | 3320040044242113 |
6 | 123335444403345 |
7 | 11054664245315 |
oct | 1505016670621 |
9 | 351873268662 |
10 | 112344134033 |
11 | 4371037576a |
12 | 199339a6555 |
13 | a795055471 |
14 | 561a65db45 |
15 | 2dc7cd5c58 |
hex | 1a283b7191 |
112344134033 has 2 divisors, whose sum is σ = 112344134034. Its totient is φ = 112344134032.
The previous prime is 112344134027. The next prime is 112344134051. The reversal of 112344134033 is 330431443211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101338445569 + 11005688464 = 318337^2 + 104908^2 .
It is a cyclic number.
It is not a de Polignac number, because 112344134033 - 28 = 112344133777 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112344133987 and 112344134005.
It is not a weakly prime, because it can be changed into another prime (112344134003) 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, 56172067016 + 56172067017.
It is an arithmetic number, because the mean of its divisors is an integer number (56172067017).
Almost surely, 2112344134033 is an apocalyptic number.
It is an amenable number.
112344134033 is a deficient number, since it is larger than the sum of its proper divisors (1).
112344134033 is an equidigital number, since it uses as much as digits as its factorization.
112344134033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 112344134033 its reverse (330431443211), we get a palindrome (442775577244).
The spelling of 112344134033 in words is "one hundred twelve billion, three hundred forty-four million, one hundred thirty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •