Base | Representation |
---|---|
bin | 11001110100011001111100… |
… | …100011111011100010000101 |
3 | 112220001111200110001011020121 |
4 | 121310121330203323202011 |
5 | 104340420341400242232 |
6 | 1041301134002101541 |
7 | 32626615125303361 |
oct | 3164317443734205 |
9 | 486044613034217 |
10 | 113552435165317 |
11 | 331aa354388135 |
12 | 1089b28094a8b1 |
13 | 4b48c4436a865 |
14 | 2007d77d622a1 |
15 | d1db5d0eed97 |
hex | 67467c8fb885 |
113552435165317 has 2 divisors, whose sum is σ = 113552435165318. Its totient is φ = 113552435165316.
The previous prime is 113552435165263. The next prime is 113552435165327. The reversal of 113552435165317 is 713561534255311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 73480572670561 + 40071862494756 = 8572081^2 + 6330234^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113552435165317 is a prime.
It is a super-2 number, since 2×1135524351653172 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113552435165327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56776217582658 + 56776217582659.
It is an arithmetic number, because the mean of its divisors is an integer number (56776217582659).
Almost surely, 2113552435165317 is an apocalyptic number.
It is an amenable number.
113552435165317 is a deficient number, since it is larger than the sum of its proper divisors (1).
113552435165317 is an equidigital number, since it uses as much as digits as its factorization.
113552435165317 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5670000, while the sum is 52.
The spelling of 113552435165317 in words is "one hundred thirteen trillion, five hundred fifty-two billion, four hundred thirty-five million, one hundred sixty-five thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •