Thread:Cherry is alive/@comment-39815821-20200803124811/@comment-46494589-20200807192325

Number of divisors: 16
 * 99999 999999 999999 999999 999999 999999 923472 313612 731263 128937 128903 (65 digits) = 2621 × 731 132867 (ECM, curve 1) × 629 696104 872572 589017 (Division) × 82 871588 726511 384877 407523 866137 (32 digits) (SIQS)

Sum of divisors: 100038 153513 400056 176377 959540 201610 711697 566736 290327 343893 181664 (66 digits)

Euler's totient: 99961 846486 704311 656873 533675 117304 051328 436364 289788 357608 209920 (65 digits)

Möbius: 1

n = a² + b² + c² + d²

a = 283 435384 222282 344127 342340 703331 (33 digits)

b = 129 191435 767051 950960 765647 011039 (33 digits)

c = 46 940470 789963 595232 779685 158075 (32 digits)

d = 27 758748 120753 666208 510753 431014 (32 digits)

Time elapsed: 0d 0h 0m 3.2s

Modular multiplications: SIQS: Timings:
 * ECM: 450600
 * Probable prime checking: 1145
 * SIQS: 9717
 * Sum of squares: 691
 * 3846 polynomials sieved
 * 23990 sets of trial divisions
 * 1231 smooth congruences found (1 out of every 94828 values)
 * 12310 partial congruences found (1 out of every 9482 values)
 * 1166 useful partial congruences
 * Size of binary matrix: 2222 × 2115
 * Probable prime test of 4 numbers: 0d 0h 0m 0.0s
 * Factoring 2 numbers using ECM: 0d 0h 0m 0.3s
 * Factoring 1 number using SIQS: 0d 0h 0m 2.9s