Search a number
-
+
113013765 = 335837139
BaseRepresentation
bin1101011110001…
…11010000000101
321212122200202000
412233013100011
5212412420030
615114135513
72541413124
oct657072005
9255580660
10113013765
115887aa07
1231a21599
131a54c067
141101babb
159dc5860
hex6bc7405

113013765 has 16 divisors (see below), whose sum is σ = 200913600. Its totient is φ = 60273936.

The previous prime is 113013737. The next prime is 113013787. The reversal of 113013765 is 567310311.

It is not a de Polignac number, because 113013765 - 26 = 113013701 is a prime.

It is a super-2 number, since 2×1130137652 = 25544222158950450, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a congruent number.

It is an unprimeable number.

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 15 ways as a sum of consecutive naturals, for example, 418435 + ... + 418704.

It is an arithmetic number, because the mean of its divisors is an integer number (12557100).

Almost surely, 2113013765 is an apocalyptic number.

113013765 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

113013765 is a deficient number, since it is larger than the sum of its proper divisors (87899835).

113013765 is an equidigital number, since it uses as much as digits as its factorization.

113013765 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 837153 (or 837147 counting only the distinct ones).

The product of its (nonzero) digits is 1890, while the sum is 27.

The square root of 113013765 is about 10630.7932441563. The cubic root of 113013765 is about 483.4784426237.

The spelling of 113013765 in words is "one hundred thirteen million, thirteen thousand, seven hundred sixty-five".

Divisors: 1 3 5 9 15 27 45 135 837139 2511417 4185695 7534251 12557085 22602753 37671255 113013765