Base | Representation |
---|---|
bin | 1101011111111… |
… | …00101100001101 |
3 | 21220001210222222 |
4 | 12233330230031 |
5 | 212441421103 |
6 | 15122545125 |
7 | 2543314232 |
oct | 657745415 |
9 | 256053888 |
10 | 113232653 |
11 | 58a0a406 |
12 | 31b081a5 |
13 | 1a5c7891 |
14 | 11077789 |
15 | 9e1a638 |
hex | 6bfcb0d |
113232653 has 8 divisors (see below), whose sum is σ = 116387640. Its totient is φ = 110119680.
The previous prime is 113232629. The next prime is 113232661. The reversal of 113232653 is 356232311.
It can be written as a sum of positive squares in 4 ways, for example, as 6461764 + 106770889 = 2542^2 + 10333^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 113232653 - 26 = 113232589 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 (113232673) 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 7 ways as a sum of consecutive naturals, for example, 5000 + ... + 15857.
It is an arithmetic number, because the mean of its divisors is an integer number (14548455).
Almost surely, 2113232653 is an apocalyptic number.
It is an amenable number.
113232653 is a deficient number, since it is larger than the sum of its proper divisors (3154987).
113232653 is an equidigital number, since it uses as much as digits as its factorization.
113232653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21007.
The product of its digits is 3240, while the sum is 26.
The square root of 113232653 is about 10641.0832625255. The cubic root of 113232653 is about 483.7903791963.
Adding to 113232653 its reverse (356232311), we get a palindrome (469464964).
The spelling of 113232653 in words is "one hundred thirteen million, two hundred thirty-two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •