Base | Representation |
---|---|
bin | 1101100000111… |
… | …01001010001101 |
3 | 21220022120102121 |
4 | 12300131022031 |
5 | 213010200040 |
6 | 15125452541 |
7 | 2544410041 |
oct | 660351215 |
9 | 256276377 |
10 | 113365645 |
11 | 58aa0318 |
12 | 31b71151 |
13 | 1a643283 |
14 | 110b0021 |
15 | 9e44c4a |
hex | 6c1d28d |
113365645 has 8 divisors (see below), whose sum is σ = 138933504. Its totient is φ = 88762704.
The previous prime is 113365631. The next prime is 113365649. The reversal of 113365645 is 546563311.
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 113365645 - 219 = 112841357 is a prime.
It is a super-3 number, since 3×1133656453 (a number of 25 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113365645.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113365649) 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, 240969 + ... + 241438.
It is an arithmetic number, because the mean of its divisors is an integer number (17366688).
Almost surely, 2113365645 is an apocalyptic number.
It is an amenable number.
113365645 is a deficient number, since it is larger than the sum of its proper divisors (25567859).
113365645 is an equidigital number, since it uses as much as digits as its factorization.
113365645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482459.
The product of its digits is 32400, while the sum is 34.
The square root of 113365645 is about 10647.3304165880. The cubic root of 113365645 is about 483.9797093809.
The spelling of 113365645 in words is "one hundred thirteen million, three hundred sixty-five thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •