Base | Representation |
---|---|
bin | 1101100101100… |
… | …10100000000101 |
3 | 21221110122112022 |
4 | 12302302200011 |
5 | 213134233344 |
6 | 15150532525 |
7 | 2552535323 |
oct | 662624005 |
9 | 257418468 |
10 | 113977349 |
11 | 59378962 |
12 | 32207145 |
13 | 1a7c8825 |
14 | 111ccd13 |
15 | a0160ee |
hex | 6cb2805 |
113977349 has 2 divisors, whose sum is σ = 113977350. Its totient is φ = 113977348.
The previous prime is 113977327. The next prime is 113977393. The reversal of 113977349 is 943779311.
It is an a-pointer prime, because the next prime (113977393) can be obtained adding 113977349 to its sum of digits (44).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65772100 + 48205249 = 8110^2 + 6943^2 .
It is an emirp because it is prime and its reverse (943779311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113977349 - 28 = 113977093 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113977399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56988674 + 56988675.
It is an arithmetic number, because the mean of its divisors is an integer number (56988675).
Almost surely, 2113977349 is an apocalyptic number.
It is an amenable number.
113977349 is a deficient number, since it is larger than the sum of its proper divisors (1).
113977349 is an equidigital number, since it uses as much as digits as its factorization.
113977349 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 142884, while the sum is 44.
The square root of 113977349 is about 10676.0174690753. The cubic root of 113977349 is about 484.8486423221.
The spelling of 113977349 in words is "one hundred thirteen million, nine hundred seventy-seven thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •