3,707,838

2 × 3² × 205991

3,707,838 factors as 2 × 3^2 × 205991. Its 12 positive divisors give a proper-divisor sum of 4,325,850, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 205991

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 8,033,688

Proper Divisor Sum 4,325,850

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3707813 ← → #3707839

Radix Representation

Decimal	3707838
Binary	1110001001001110111110 (22 bits)
Octal	0o16111676
Hexadecimal	0x3893BE

Divisor Catalog (12)

1 2 3 6 9 18 205,991 411,982 617,973 1,235,946 1,853,919 3,707,838

Collatz Trajectory (185 steps to reach 1)

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

3,707,838 1,853,919 5,561,758 2,780,879 8,342,638 4,171,319 12,513,958 6,256,979 18,770,938 9,385,469 28,156,408 14,078,204 7,039,102 3,519,551 10,558,654 5,279,327 15,837,982 7,918,991 23,756,974 11,878,487 35,635,462 17,817,731 53,453,194 26,726,597 80,179,792 40,089,896 20,044,948 10,022,474 5,011,237 15,033,712 7,516,856 3,758,428 1,879,214 939,607 2,818,822 1,409,411 4,228,234 2,114,117 6,342,352 3,171,176 1,585,588 792,794 396,397 1,189,192 594,596 297,298 148,649 445,948 222,974 111,487 334,462 167,231 501,694 250,847 752,542 376,271 1,128,814 564,407 1,693,222 846,611

← Previous Integer #3,707,837 Browse Full Index Next Integer #3,707,839 →