Base | Representation |
---|---|
bin | 1101011110101… |
… | …01011001011101 |
3 | 21212202122020002 |
4 | 12233111121131 |
5 | 212421243314 |
6 | 15115304045 |
7 | 2542044062 |
oct | 657253135 |
9 | 255678202 |
10 | 113071709 |
11 | 5890a4a3 |
12 | 31a4b025 |
13 | 1a56c54a |
14 | 11034c69 |
15 | 9dd7ade |
hex | 6bd565d |
113071709 has 4 divisors (see below), whose sum is σ = 119723004. Its totient is φ = 106420416.
The previous prime is 113071697. The next prime is 113071711. The reversal of 113071709 is 907170311.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 106296100 + 6775609 = 10310^2 + 2603^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113071709 is a prime.
It is a super-2 number, since 2×1130717092 = 25570422752361362, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113071799) 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 in 3 ways as a sum of consecutive naturals, for example, 3325622 + ... + 3325655.
It is an arithmetic number, because the mean of its divisors is an integer number (29930751).
Almost surely, 2113071709 is an apocalyptic number.
It is an amenable number.
113071709 is a deficient number, since it is larger than the sum of its proper divisors (6651295).
113071709 is an equidigital number, since it uses as much as digits as its factorization.
113071709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6651294.
The product of its (nonzero) digits is 1323, while the sum is 29.
The square root of 113071709 is about 10633.5181854361. The cubic root of 113071709 is about 483.5610575995.
The spelling of 113071709 in words is "one hundred thirteen million, seventy-one thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •