Base | Representation |
---|---|
bin | 1101100010101… |
… | …00110101010001 |
3 | 21220202011020101 |
4 | 12301110311101 |
5 | 213034444211 |
6 | 15134412401 |
7 | 2546346625 |
oct | 661246521 |
9 | 256664211 |
10 | 113593681 |
11 | 59136683 |
12 | 32061101 |
13 | 1a6c2cc6 |
14 | 1112d185 |
15 | 9e8c5c1 |
hex | 6c54d51 |
113593681 has 8 divisors (see below), whose sum is σ = 117370944. Its totient is φ = 109877040.
The previous prime is 113593679. The next prime is 113593691. The reversal of 113593681 is 186395311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 113593681 - 21 = 113593679 is a prime.
It is a super-2 number, since 2×1135936812 = 25807048726259522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 113593681.
It is not an unprimeable number, because it can be changed into a prime (113593631) 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 in 7 ways as a sum of consecutive naturals, for example, 11331 + ... + 18856.
It is an arithmetic number, because the mean of its divisors is an integer number (14671368).
Almost surely, 2113593681 is an apocalyptic number.
It is an amenable number.
113593681 is a deficient number, since it is larger than the sum of its proper divisors (3777263).
113593681 is an equidigital number, since it uses as much as digits as its factorization.
113593681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30311.
The product of its digits is 19440, while the sum is 37.
The square root of 113593681 is about 10658.0336366517. The cubic root of 113593681 is about 484.3040018644.
The spelling of 113593681 in words is "one hundred thirteen million, five hundred ninety-three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •