Base | Representation |
---|---|
bin | 1101100100101… |
… | …11010111110101 |
3 | 21221021000002202 |
4 | 12302113113311 |
5 | 213122204404 |
6 | 15144314245 |
7 | 2551563341 |
oct | 662272765 |
9 | 257230082 |
10 | 113866229 |
11 | 59302424 |
12 | 32172985 |
13 | 1a78a089 |
14 | 111a0621 |
15 | 9ee321e |
hex | 6c975f5 |
113866229 has 2 divisors, whose sum is σ = 113866230. Its totient is φ = 113866228.
The previous prime is 113866219. The next prime is 113866243. The reversal of 113866229 is 922668311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70174129 + 43692100 = 8377^2 + 6610^2 .
It is an emirp because it is prime and its reverse (922668311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113866229 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 113866192 and 113866201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113866219) 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, 56933114 + 56933115.
It is an arithmetic number, because the mean of its divisors is an integer number (56933115).
Almost surely, 2113866229 is an apocalyptic number.
It is an amenable number.
113866229 is a deficient number, since it is larger than the sum of its proper divisors (1).
113866229 is an equidigital number, since it uses as much as digits as its factorization.
113866229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 31104, while the sum is 38.
The square root of 113866229 is about 10670.8120122135. The cubic root of 113866229 is about 484.6910265044.
The spelling of 113866229 in words is "one hundred thirteen million, eight hundred sixty-six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •