Base | Representation |
---|---|
bin | 1101100000011… |
… | …01010010010111 |
3 | 21220012021020200 |
4 | 12300031102113 |
5 | 213001110011 |
6 | 15124231543 |
7 | 2544016353 |
oct | 660152227 |
9 | 256167220 |
10 | 113300631 |
11 | 58a56494 |
12 | 31b3b5b3 |
13 | 1a61c7c2 |
14 | 11094463 |
15 | 9e30856 |
hex | 6c0d497 |
113300631 has 12 divisors (see below), whose sum is σ = 173283552. Its totient is φ = 71090496.
The previous prime is 113300617. The next prime is 113300633. The reversal of 113300631 is 136003311.
113300631 is a `hidden beast` number, since 1 + 1 + 3 + 30 + 0 + 631 = 666.
It is not a de Polignac number, because 113300631 - 218 = 113038487 is a prime.
It is a super-3 number, since 3×1133006313 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113300633) 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 11 ways as a sum of consecutive naturals, for example, 370111 + ... + 370416.
It is an arithmetic number, because the mean of its divisors is an integer number (14440296).
Almost surely, 2113300631 is an apocalyptic number.
113300631 is a deficient number, since it is larger than the sum of its proper divisors (59982921).
113300631 is a wasteful number, since it uses less digits than its factorization.
113300631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 740550 (or 740547 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
The square root of 113300631 is about 10644.2769129707. The cubic root of 113300631 is about 483.8871726052.
Adding to 113300631 its reverse (136003311), we get a palindrome (249303942).
The spelling of 113300631 in words is "one hundred thirteen million, three hundred thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •