Base | Representation |
---|---|
bin | 1101011100000… |
… | …11111111100101 |
3 | 21212010200211202 |
4 | 12232003333211 |
5 | 212330111102 |
6 | 15104212245 |
7 | 2536155011 |
oct | 656037745 |
9 | 255120752 |
10 | 112738277 |
11 | 58701a33 |
12 | 3190a085 |
13 | 1a483852 |
14 | 10d89541 |
15 | 9d6de02 |
hex | 6b83fe5 |
112738277 has 2 divisors, whose sum is σ = 112738278. Its totient is φ = 112738276.
The previous prime is 112738253. The next prime is 112738279. The reversal of 112738277 is 772837211.
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., 97792321 + 14945956 = 9889^2 + 3866^2 .
It is a cyclic number.
It is not a de Polignac number, because 112738277 - 214 = 112721893 is a prime.
Together with 112738279, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112738277.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112738279) 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, 56369138 + 56369139.
It is an arithmetic number, because the mean of its divisors is an integer number (56369139).
Almost surely, 2112738277 is an apocalyptic number.
It is an amenable number.
112738277 is a deficient number, since it is larger than the sum of its proper divisors (1).
112738277 is an equidigital number, since it uses as much as digits as its factorization.
112738277 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 32928, while the sum is 38.
The square root of 112738277 is about 10617.8282619376. The cubic root of 112738277 is about 483.0852725777.
The spelling of 112738277 in words is "one hundred twelve million, seven hundred thirty-eight thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.165 sec. • engine limits •