Base | Representation |
---|---|
bin | 1101011111011… |
… | …01100011100101 |
3 | 21212221122221222 |
4 | 12233231203211 |
5 | 212432430121 |
6 | 15121350125 |
7 | 2542635422 |
oct | 657554345 |
9 | 255848858 |
10 | 113170661 |
11 | 5897787a |
12 | 31a98345 |
13 | 1a5a55b6 |
14 | 1105cd49 |
15 | 9e070ab |
hex | 6bed8e5 |
113170661 has 2 divisors, whose sum is σ = 113170662. Its totient is φ = 113170660.
The previous prime is 113170657. The next prime is 113170691. The reversal of 113170661 is 166071311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 97812100 + 15358561 = 9890^2 + 3919^2 .
It is a cyclic number.
It is not a de Polignac number, because 113170661 - 22 = 113170657 is a prime.
It is a super-3 number, since 3×1131706613 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 113170661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113170691) 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, 56585330 + 56585331.
It is an arithmetic number, because the mean of its divisors is an integer number (56585331).
Almost surely, 2113170661 is an apocalyptic number.
It is an amenable number.
113170661 is a deficient number, since it is larger than the sum of its proper divisors (1).
113170661 is an equidigital number, since it uses as much as digits as its factorization.
113170661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 26.
The square root of 113170661 is about 10638.1700024017. The cubic root of 113170661 is about 483.7020754336.
The spelling of 113170661 in words is "one hundred thirteen million, one hundred seventy thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •