Base | Representation |
---|---|
bin | 1101011101111… |
… | …10010001110101 |
3 | 21212120211022211 |
4 | 12232332101311 |
5 | 212410231023 |
6 | 15113253421 |
7 | 2541201022 |
oct | 656762165 |
9 | 255524284 |
10 | 112977013 |
11 | 58855336 |
12 | 31a04271 |
13 | 1a538406 |
14 | 1100c549 |
15 | 9db9a0d |
hex | 6bbe475 |
112977013 has 2 divisors, whose sum is σ = 112977014. Its totient is φ = 112977012.
The previous prime is 112977001. The next prime is 112977047. The reversal of 112977013 is 310779211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 59876644 + 53100369 = 7738^2 + 7287^2 .
It is an emirp because it is prime and its reverse (310779211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112977013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112971013) 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, 56488506 + 56488507.
It is an arithmetic number, because the mean of its divisors is an integer number (56488507).
Almost surely, 2112977013 is an apocalyptic number.
It is an amenable number.
112977013 is a deficient number, since it is larger than the sum of its proper divisors (1).
112977013 is an equidigital number, since it uses as much as digits as its factorization.
112977013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2646, while the sum is 31.
The square root of 112977013 is about 10629.0645402124. The cubic root of 112977013 is about 483.4260279873.
The spelling of 112977013 in words is "one hundred twelve million, nine hundred seventy-seven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •