3,853,892

2² × 7 × 137639

3,853,892 factors as 2^2 × 7 × 137639. Its 12 positive divisors give a proper-divisor sum of 3,853,948, so this integer is abundant. The Collatz stopping time is 216 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 137639

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,707,840

Proper Divisor Sum 3,853,948

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #3853873 ← → #3853909

Radix Representation

Decimal	3853892
Binary	1110101100111001000100 (22 bits)
Octal	0o16547104
Hexadecimal	0x3ACE44

Divisor Catalog (12)

1 2 4 7 14 28 137,639 275,278 550,556 963,473 1,926,946 3,853,892

Collatz Trajectory (216 steps to reach 1)

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

3,853,892 1,926,946 963,473 2,890,420 1,445,210 722,605 2,167,816 1,083,908 541,954 270,977 812,932 406,466 203,233 609,700 304,850 152,425 457,276 228,638 114,319 342,958 171,479 514,438 257,219 771,658 385,829 1,157,488 578,744 289,372 144,686 72,343 217,030 108,515 325,546 162,773 488,320 244,160 122,080 61,040 30,520 15,260 7,630 3,815 11,446 5,723 17,170 8,585 25,756 12,878 6,439 19,318 9,659 28,978 14,489 43,468 21,734 10,867 32,602 16,301 48,904 24,452

← Previous Integer #3,853,891 Browse Full Index Next Integer #3,853,893 →