Base | Representation |
---|---|
bin | 1101100000011… |
… | …01000001101001 |
3 | 21220012012210001 |
4 | 12300031001221 |
5 | 213001041221 |
6 | 15124223001 |
7 | 2544013264 |
oct | 660150151 |
9 | 256165701 |
10 | 113299561 |
11 | 58a55701 |
12 | 31b3aa61 |
13 | 1a61c17b |
14 | 11093cdb |
15 | 9e30391 |
hex | 6c0d069 |
113299561 has 4 divisors (see below), whose sum is σ = 113321092. Its totient is φ = 113278032.
The previous prime is 113299547. The next prime is 113299609. The reversal of 113299561 is 165992311.
It is a happy number.
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 34445161 + 78854400 = 5869^2 + 8880^2 .
It is a cyclic number.
It is not a de Polignac number, because 113299561 - 221 = 111202409 is a prime.
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 113299561.
It is not an unprimeable number, because it can be changed into a prime (113299861) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2971 + ... + 15343.
It is an arithmetic number, because the mean of its divisors is an integer number (28330273).
Almost surely, 2113299561 is an apocalyptic number.
It is an amenable number.
113299561 is a deficient number, since it is larger than the sum of its proper divisors (21531).
113299561 is an equidigital number, since it uses as much as digits as its factorization.
113299561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21530.
The product of its digits is 14580, while the sum is 37.
The square root of 113299561 is about 10644.2266511006. The cubic root of 113299561 is about 483.8856493395.
The spelling of 113299561 in words is "one hundred thirteen million, two hundred ninety-nine thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •