3,587,752

2³ × 7 × 64067

3,587,752 factors as 2^3 × 7 × 64067. Its 16 positive divisors give a proper-divisor sum of 4,100,408, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 64067

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,688,160

Proper Divisor Sum 4,100,408

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #3587741 ← → #3587761

Radix Representation

Decimal	3587752
Binary	1101101011111010101000 (22 bits)
Octal	0o15537250
Hexadecimal	0x36BEA8

Divisor Catalog (16)

1 2 4 7 8 14 28 56 64,067 128,134 256,268 448,469 512,536 896,938 1,793,876 3,587,752

Collatz Trajectory (97 steps to reach 1)

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

3,587,752 1,793,876 896,938 448,469 1,345,408 672,704 336,352 168,176 84,088 42,044 21,022 10,511 31,534 15,767 47,302 23,651 70,954 35,477 106,432 53,216 26,608 13,304 6,652 3,326 1,663 4,990 2,495 7,486 3,743 11,230 5,615 16,846 8,423 25,270 12,635 37,906 18,953 56,860 28,430 14,215 42,646 21,323 63,970 31,985 95,956 47,978 23,989 71,968 35,984 17,992 8,996 4,498 2,249 6,748 3,374 1,687 5,062 2,531 7,594 3,797

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,587,751 Browse Full Index Next Integer #3,587,753 →