Base | Representation |
---|---|
bin | 1101011111001… |
… | …00110111001101 |
3 | 21212212212010011 |
4 | 12233210313031 |
5 | 212430310203 |
6 | 15120513221 |
7 | 2542426543 |
oct | 657446715 |
9 | 255785104 |
10 | 113135053 |
11 | 58953049 |
12 | 31a7b811 |
13 | 1a592325 |
14 | 1104dd93 |
15 | 9deb76d |
hex | 6be4dcd |
113135053 has 4 divisors (see below), whose sum is σ = 114989788. Its totient is φ = 111280320.
The previous prime is 113135047. The next prime is 113135069. The reversal of 113135053 is 350531311.
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 1684804 + 111450249 = 1298^2 + 10557^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113135053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113135023) 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, 927276 + ... + 927397.
It is an arithmetic number, because the mean of its divisors is an integer number (28747447).
Almost surely, 2113135053 is an apocalyptic number.
It is an amenable number.
113135053 is a deficient number, since it is larger than the sum of its proper divisors (1854735).
113135053 is an equidigital number, since it uses as much as digits as its factorization.
113135053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1854734.
The product of its (nonzero) digits is 675, while the sum is 22.
The square root of 113135053 is about 10636.4962746198. The cubic root of 113135053 is about 483.6513394623.
Adding to 113135053 its reverse (350531311), we get a palindrome (463666364).
The spelling of 113135053 in words is "one hundred thirteen million, one hundred thirty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •