1,563,396

2² × 3 × 19 × 6857

1,563,396 factors as 2^2 × 3 × 19 × 6857. Its 24 positive divisors give a proper-divisor sum of 2,277,084, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 19 × 6857

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 3,840,480

Proper Divisor Sum 2,277,084

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1563389 ← → #1563407

Radix Representation

Decimal	1563396
Binary	101111101101100000100 (21 bits)
Octal	0o5755404
Hexadecimal	0x17DB04

Divisor Catalog (24)

1 2 3 4 6 12 19 38 57 76 114 228 6,857 13,714 20,571 27,428 41,142 82,284 130,283 260,566 390,849 521,132 781,698 1,563,396

Collatz Trajectory (163 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

1,563,396 781,698 390,849 1,172,548 586,274 293,137 879,412 439,706 219,853 659,560 329,780 164,890 82,445 247,336 123,668 61,834 30,917 92,752 46,376 23,188 11,594 5,797 17,392 8,696 4,348 2,174 1,087 3,262 1,631 4,894 2,447 7,342 3,671 11,014 5,507 16,522 8,261 24,784 12,392 6,196 3,098 1,549 4,648 2,324 1,162 581 1,744 872 436 218 109 328 164 82 41 124 62 31 94 47

← Previous Integer #1,563,395 Browse Full Index Next Integer #1,563,397 →