Base | Representation |
---|---|
bin | 1101100000000… |
… | …01011111011001 |
3 | 21220002210222010 |
4 | 12300001133121 |
5 | 212443033223 |
6 | 15123220133 |
7 | 2543425446 |
oct | 660013731 |
9 | 256083863 |
10 | 113252313 |
11 | 58a23159 |
12 | 31b17649 |
13 | 1a603805 |
14 | 110809cd |
15 | 9e21393 |
hex | 6c017d9 |
113252313 has 8 divisors (see below), whose sum is σ = 153130176. Its totient is φ = 74438000.
The previous prime is 113252303. The next prime is 113252323. The reversal of 113252313 is 313252311.
It is an interprime number because it is at equal distance from previous prime (113252303) and next prime (113252323).
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 113252313 - 24 = 113252297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113252313.
It is not an unprimeable number, because it can be changed into a prime (113252303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 265638 + ... + 266063.
It is an arithmetic number, because the mean of its divisors is an integer number (19141272).
Almost surely, 2113252313 is an apocalyptic number.
It is an amenable number.
113252313 is a deficient number, since it is larger than the sum of its proper divisors (39877863).
113252313 is an equidigital number, since it uses as much as digits as its factorization.
113252313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 531775.
The product of its digits is 540, while the sum is 21.
The square root of 113252313 is about 10642.0070005615. The cubic root of 113252313 is about 483.8183769166.
The spelling of 113252313 in words is "one hundred thirteen million, two hundred fifty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •