1,828,722

2 × 3 × 7 × 43541

1,828,722 factors as 2 × 3 × 7 × 43541. Its 16 positive divisors give a proper-divisor sum of 2,351,310, so this integer is abundant. The Collatz stopping time is 109 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 43541

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,180,032

Proper Divisor Sum 2,351,310

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1828709 ← → #1828727

Radix Representation

Decimal	1828722
Binary	110111110011101110010 (21 bits)
Octal	0o6763562
Hexadecimal	0x1BE772

Divisor Catalog (16)

1 2 3 6 7 14 21 42 43,541 87,082 130,623 261,246 304,787 609,574 914,361 1,828,722

Collatz Trajectory (109 steps to reach 1)

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

1,828,722 914,361 2,743,084 1,371,542 685,771 2,057,314 1,028,657 3,085,972 1,542,986 771,493 2,314,480 1,157,240 578,620 289,310 144,655 433,966 216,983 650,950 325,475 976,426 488,213 1,464,640 732,320 366,160 183,080 91,540 45,770 22,885 68,656 34,328 17,164 8,582 4,291 12,874 6,437 19,312 9,656 4,828 2,414 1,207 3,622 1,811 5,434 2,717 8,152 4,076 2,038 1,019 3,058 1,529 4,588 2,294 1,147 3,442 1,721 5,164 2,582 1,291 3,874 1,937

← Previous Integer #1,828,721 Browse Full Index Next Integer #1,828,723 →