Base | Representation |
---|---|
bin | 11001101110010000101111… |
… | …110110001100010110101001 |
3 | 112211120010221000211020020202 |
4 | 121232100233312030112221 |
5 | 104312011213233442134 |
6 | 1040335152042401545 |
7 | 32554250561620214 |
oct | 3156205766142651 |
9 | 484503830736222 |
10 | 113130241312169 |
11 | 330572a1a15444 |
12 | 10831494b002b5 |
13 | 4b1819c996043 |
14 | 1dd176639a77b |
15 | d12b9d084d7e |
hex | 66e42fd8c5a9 |
113130241312169 has 2 divisors, whose sum is σ = 113130241312170. Its totient is φ = 113130241312168.
The previous prime is 113130241312117. The next prime is 113130241312181. The reversal of 113130241312169 is 961213142031311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106393283642944 + 6736957669225 = 10314712^2 + 2595565^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113130241312169 is a prime.
It is a super-2 number, since 2×1131302413121692 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (113130241312189) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56565120656084 + 56565120656085.
It is an arithmetic number, because the mean of its divisors is an integer number (56565120656085).
Almost surely, 2113130241312169 is an apocalyptic number.
It is an amenable number.
113130241312169 is a deficient number, since it is larger than the sum of its proper divisors (1).
113130241312169 is an equidigital number, since it uses as much as digits as its factorization.
113130241312169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 38.
The spelling of 113130241312169 in words is "one hundred thirteen trillion, one hundred thirty billion, two hundred forty-one million, three hundred twelve thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •