Base | Representation |
---|---|
bin | 1101011111010… |
… | …00110000110101 |
3 | 21212220200000212 |
4 | 12233220300311 |
5 | 212431313104 |
6 | 15121115205 |
7 | 2542524245 |
oct | 657506065 |
9 | 255820025 |
10 | 113151029 |
11 | 58964052 |
12 | 31a88b05 |
13 | 1a599694 |
14 | 11055b25 |
15 | 9e0136e |
hex | 6be8c35 |
113151029 has 2 divisors, whose sum is σ = 113151030. Its totient is φ = 113151028.
The previous prime is 113151019. The next prime is 113151037. The reversal of 113151029 is 920151311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106048804 + 7102225 = 10298^2 + 2665^2 .
It is an emirp because it is prime and its reverse (920151311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113151029 - 216 = 113085493 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 113150995 and 113151013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113151019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56575514 + 56575515.
It is an arithmetic number, because the mean of its divisors is an integer number (56575515).
Almost surely, 2113151029 is an apocalyptic number.
It is an amenable number.
113151029 is a deficient number, since it is larger than the sum of its proper divisors (1).
113151029 is an equidigital number, since it uses as much as digits as its factorization.
113151029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 23.
The square root of 113151029 is about 10637.2472472910. The cubic root of 113151029 is about 483.6741041431.
The spelling of 113151029 in words is "one hundred thirteen million, one hundred fifty-one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •