Base | Representation |
---|---|
bin | 1101100011000… |
… | …00010011111001 |
3 | 21220211112201201 |
4 | 12301200103321 |
5 | 213043000242 |
6 | 15135414201 |
7 | 2546633662 |
oct | 661402371 |
9 | 256745651 |
10 | 113640697 |
11 | 59168a35 |
12 | 32084361 |
13 | 1a70b521 |
14 | 11142369 |
15 | 9e9b4b7 |
hex | 6c604f9 |
113640697 has 2 divisors, whose sum is σ = 113640698. Its totient is φ = 113640696.
The previous prime is 113640679. The next prime is 113640707. The reversal of 113640697 is 796046311.
Together with previous prime (113640679) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111281401 + 2359296 = 10549^2 + 1536^2 .
It is a cyclic number.
It is not a de Polignac number, because 113640697 - 211 = 113638649 is a prime.
It is not a weakly prime, because it can be changed into another prime (113640617) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56820348 + 56820349.
It is an arithmetic number, because the mean of its divisors is an integer number (56820349).
Almost surely, 2113640697 is an apocalyptic number.
It is an amenable number.
113640697 is a deficient number, since it is larger than the sum of its proper divisors (1).
113640697 is an equidigital number, since it uses as much as digits as its factorization.
113640697 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 37.
The square root of 113640697 is about 10660.2390686138. The cubic root of 113640697 is about 484.3708098535.
The spelling of 113640697 in words is "one hundred thirteen million, six hundred forty thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •