Base | Representation |
---|---|
bin | 1101100001111… |
… | …10010110111101 |
3 | 21220120110222001 |
4 | 12300332112331 |
5 | 213024023004 |
6 | 15132422301 |
7 | 2545514353 |
oct | 660762675 |
9 | 256513861 |
10 | 113501629 |
11 | 590834aa |
12 | 32017991 |
13 | 1a690137 |
14 | 111077d3 |
15 | 9e701a4 |
hex | 6c3e5bd |
113501629 has 2 divisors, whose sum is σ = 113501630. Its totient is φ = 113501628.
The previous prime is 113501617. The next prime is 113501657. The reversal of 113501629 is 926105311.
It is an a-pointer prime, because the next prime (113501657) can be obtained adding 113501629 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98307225 + 15194404 = 9915^2 + 3898^2 .
It is a cyclic number.
It is not a de Polignac number, because 113501629 - 213 = 113493437 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 113501597 and 113501606.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113501659) 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 as a sum of consecutive naturals, namely, 56750814 + 56750815.
It is an arithmetic number, because the mean of its divisors is an integer number (56750815).
Almost surely, 2113501629 is an apocalyptic number.
It is an amenable number.
113501629 is a deficient number, since it is larger than the sum of its proper divisors (1).
113501629 is an equidigital number, since it uses as much as digits as its factorization.
113501629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 28.
The square root of 113501629 is about 10653.7143288151. The cubic root of 113501629 is about 484.1731459949.
The spelling of 113501629 in words is "one hundred thirteen million, five hundred one thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •