Base | Representation |
---|---|
bin | 110100010011011101… |
… | …0110101001010110101 |
3 | 101201220220212012000101 |
4 | 1220212322311022311 |
5 | 3320013424343122 |
6 | 123333340314101 |
7 | 11054306101621 |
oct | 1504672651265 |
9 | 351826765011 |
10 | 112322106037 |
11 | 436a999a809 |
12 | 19928542931 |
13 | a790611c4b |
14 | 5617768181 |
15 | 2dc5dd4027 |
hex | 1a26eb52b5 |
112322106037 has 2 divisors, whose sum is σ = 112322106038. Its totient is φ = 112322106036.
The previous prime is 112322105993. The next prime is 112322106047. The reversal of 112322106037 is 730601223211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 110725224516 + 1596881521 = 332754^2 + 39961^2 .
It is an emirp because it is prime and its reverse (730601223211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112322106037 - 211 = 112322103989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112322105996 and 112322106014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112322106047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56161053018 + 56161053019.
It is an arithmetic number, because the mean of its divisors is an integer number (56161053019).
Almost surely, 2112322106037 is an apocalyptic number.
It is an amenable number.
112322106037 is a deficient number, since it is larger than the sum of its proper divisors (1).
112322106037 is an equidigital number, since it uses as much as digits as its factorization.
112322106037 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 112322106037 its reverse (730601223211), we get a palindrome (842923329248).
The spelling of 112322106037 in words is "one hundred twelve billion, three hundred twenty-two million, one hundred six thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •