Base | Representation |
---|---|
bin | 1101100000000… |
… | …01010011101001 |
3 | 21220002202221021 |
4 | 12300001103221 |
5 | 212443022221 |
6 | 15123212441 |
7 | 2543423323 |
oct | 660012351 |
9 | 256082837 |
10 | 113251561 |
11 | 58a22635 |
12 | 31b17121 |
13 | 1a603377 |
14 | 11080613 |
15 | 9e21041 |
hex | 6c014e9 |
113251561 has 4 divisors (see below), whose sum is σ = 116312452. Its totient is φ = 110190672.
The previous prime is 113251559. The next prime is 113251573. The reversal of 113251561 is 165152311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 165152311 = 521 ⋅316991.
It can be written as a sum of positive squares in 2 ways, for example, as 60543961 + 52707600 = 7781^2 + 7260^2 .
It is a cyclic number.
It is not a de Polignac number, because 113251561 - 21 = 113251559 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113251511) 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, 1530390 + ... + 1530463.
It is an arithmetic number, because the mean of its divisors is an integer number (29078113).
Almost surely, 2113251561 is an apocalyptic number.
It is an amenable number.
113251561 is a deficient number, since it is larger than the sum of its proper divisors (3060891).
113251561 is an equidigital number, since it uses as much as digits as its factorization.
113251561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3060890.
The product of its digits is 900, while the sum is 25.
The square root of 113251561 is about 10641.9716688215. The cubic root of 113251561 is about 483.8173060563.
The spelling of 113251561 in words is "one hundred thirteen million, two hundred fifty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •