Base | Representation |
---|---|
bin | 110100110000101010… |
… | …1011000010011100101 |
3 | 101211110012222021200012 |
4 | 1221201111120103211 |
5 | 3324020322103404 |
6 | 124014510100005 |
7 | 11120506223051 |
oct | 1514125302345 |
9 | 354405867605 |
10 | 113302144229 |
11 | 44062119a2a |
12 | 19b607aa605 |
13 | a8b86801c1 |
14 | 56ab99ac61 |
15 | 2e31e70a6e |
hex | 1a615584e5 |
113302144229 has 2 divisors, whose sum is σ = 113302144230. Its totient is φ = 113302144228.
The previous prime is 113302144223. The next prime is 113302144247. The reversal of 113302144229 is 922441203311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110106503329 + 3195640900 = 331823^2 + 56530^2 .
It is an emirp because it is prime and its reverse (922441203311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113302144229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 113302144195 and 113302144204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113302144223) 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, 56651072114 + 56651072115.
It is an arithmetic number, because the mean of its divisors is an integer number (56651072115).
Almost surely, 2113302144229 is an apocalyptic number.
It is an amenable number.
113302144229 is a deficient number, since it is larger than the sum of its proper divisors (1).
113302144229 is an equidigital number, since it uses as much as digits as its factorization.
113302144229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 113302144229 in words is "one hundred thirteen billion, three hundred two million, one hundred forty-four thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •