3,703,720

2³ × 5 × 92593

3,703,720 factors as 2^3 × 5 × 92593. Its 16 positive divisors give a proper-divisor sum of 4,629,740, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 92593

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,333,460

Proper Divisor Sum 4,629,740

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #3703703 ← → #3703723

Radix Representation

Decimal	3703720
Binary	1110001000001110101000 (22 bits)
Octal	0o16101650
Hexadecimal	0x3883A8

Divisor Catalog (16)

1 2 4 5 8 10 20 40 92,593 185,186 370,372 462,965 740,744 925,930 1,851,860 3,703,720

Collatz Trajectory (172 steps to reach 1)

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

3,703,720 1,851,860 925,930 462,965 1,388,896 694,448 347,224 173,612 86,806 43,403 130,210 65,105 195,316 97,658 48,829 146,488 73,244 36,622 18,311 54,934 27,467 82,402 41,201 123,604 61,802 30,901 92,704 46,352 23,176 11,588 5,794 2,897 8,692 4,346 2,173 6,520 3,260 1,630 815 2,446 1,223 3,670 1,835 5,506 2,753 8,260 4,130 2,065 6,196 3,098 1,549 4,648 2,324 1,162 581 1,744 872 436 218 109

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,703,719 Browse Full Index Next Integer #3,703,721 →