2,378,802

2 × 3 × 449 × 883

2,378,802 factors as 2 × 3 × 449 × 883. Its 16 positive divisors give a proper-divisor sum of 2,394,798, so this integer is abundant. The Collatz stopping time is 143 steps.

Prime Factor Structure

Factorization String 2 × 3 × 449 × 883

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,773,600

Proper Divisor Sum 2,394,798

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2378801 ← → #2378807

Radix Representation

Decimal	2378802
Binary	1001000100110000110010 (22 bits)
Octal	0o11046062
Hexadecimal	0x244C32

Divisor Catalog (16)

1 2 3 6 449 883 898 1,347 1,766 2,649 2,694 5,298 396,467 792,934 1,189,401 2,378,802

Collatz Trajectory (143 steps to reach 1)

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

2,378,802 1,189,401 3,568,204 1,784,102 892,051 2,676,154 1,338,077 4,014,232 2,007,116 1,003,558 501,779 1,505,338 752,669 2,258,008 1,129,004 564,502 282,251 846,754 423,377 1,270,132 635,066 317,533 952,600 476,300 238,150 119,075 357,226 178,613 535,840 267,920 133,960 66,980 33,490 16,745 50,236 25,118 12,559 37,678 18,839 56,518 28,259 84,778 42,389 127,168 63,584 31,792 15,896 7,948 3,974 1,987 5,962 2,981 8,944 4,472 2,236 1,118 559 1,678 839 2,518

← Previous Integer #2,378,801 Browse Full Index Next Integer #2,378,803 →