3,765,028

2² × 797 × 1181

3,765,028 factors as 2^2 × 797 × 1181. Its 12 positive divisors give a proper-divisor sum of 2,837,624, so this integer is deficient. The Collatz stopping time is 128 steps.

Prime Factor Structure

Factorization String 2^2 × 797 × 1181

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,602,652

Proper Divisor Sum 2,837,624

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3765023 ← → #3765049

Radix Representation

Decimal	3765028
Binary	1110010111001100100100 (22 bits)
Octal	0o16271444
Hexadecimal	0x397324

Divisor Catalog (12)

1 2 4 797 1,181 1,594 2,362 3,188 4,724 941,257 1,882,514 3,765,028

Collatz Trajectory (128 steps to reach 1)

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

3,765,028 1,882,514 941,257 2,823,772 1,411,886 705,943 2,117,830 1,058,915 3,176,746 1,588,373 4,765,120 2,382,560 1,191,280 595,640 297,820 148,910 74,455 223,366 111,683 335,050 167,525 502,576 251,288 125,644 62,822 31,411 94,234 47,117 141,352 70,676 35,338 17,669 53,008 26,504 13,252 6,626 3,313 9,940 4,970 2,485 7,456 3,728 1,864 932 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336 668

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,765,027 Browse Full Index Next Integer #3,765,029 →