Base | Representation |
---|---|
bin | 1101100101000… |
… | …01111101100101 |
3 | 21221100012121021 |
4 | 12302201331211 |
5 | 213130101410 |
6 | 15145251141 |
7 | 2552133655 |
oct | 662417545 |
9 | 257305537 |
10 | 113909605 |
11 | 59331a77 |
12 | 32193ab1 |
13 | 1a7a3a44 |
14 | 111b2365 |
15 | a000eda |
hex | 6ca1f65 |
113909605 has 8 divisors (see below), whose sum is σ = 144732312. Its totient is φ = 85767168.
The previous prime is 113909599. The next prime is 113909611. The reversal of 113909605 is 506909311.
It is an interprime number because it is at equal distance from previous prime (113909599) and next prime (113909611).
It can be written as a sum of positive squares in 4 ways, for example, as 4435236 + 109474369 = 2106^2 + 10463^2 .
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 113909605 - 23 = 113909597 is a prime.
It is a super-2 number, since 2×1139096052 = 25950796222512050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 669972 + ... + 670141.
It is an arithmetic number, because the mean of its divisors is an integer number (18091539).
Almost surely, 2113909605 is an apocalyptic number.
It is an amenable number.
113909605 is a deficient number, since it is larger than the sum of its proper divisors (30822707).
113909605 is a wasteful number, since it uses less digits than its factorization.
113909605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1340135.
The product of its (nonzero) digits is 7290, while the sum is 34.
The square root of 113909605 is about 10672.8442788228. The cubic root of 113909605 is about 484.7525644719.
The spelling of 113909605 in words is "one hundred thirteen million, nine hundred nine thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •