7,644,280

2³ × 5 × 7 × 23 × 1187

7,644,280 factors as 2^3 × 5 × 7 × 23 × 1187. Its 64 positive divisors give a proper-divisor sum of 12,884,360, so this integer is abundant. The Collatz stopping time is 173 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 7 × 23 × 1187

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 20,528,640

Proper Divisor Sum 12,884,360

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #7644269 ← → #7644281

Radix Representation

Decimal	7644280
Binary	11101001010010001111000 (23 bits)
Octal	0o35122170
Hexadecimal	0x74A478

Divisor Catalog (60 of 64)

1 2 4 5 7 8 10 14 20 23 28 35 40 46 56 70 92 115 140 161 184 230 280 322 460 644 805 920 1,187 1,288 1,610 2,374 3,220 4,748 5,935 6,440 8,309 9,496 11,870 16,618 23,740 27,301 33,236 41,545 47,480 54,602 66,472 83,090 109,204 136,505 166,180 191,107 218,408 273,010 332,360 382,214 546,020 764,428 955,535 1,092,040

Collatz Trajectory (173 steps to reach 1)

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

7,644,280 3,822,140 1,911,070 955,535 2,866,606 1,433,303 4,299,910 2,149,955 6,449,866 3,224,933 9,674,800 4,837,400 2,418,700 1,209,350 604,675 1,814,026 907,013 2,721,040 1,360,520 680,260 340,130 170,065 510,196 255,098 127,549 382,648 191,324 95,662 47,831 143,494 71,747 215,242 107,621 322,864 161,432 80,716 40,358 20,179 60,538 30,269 90,808 45,404 22,702 11,351 34,054 17,027 51,082 25,541 76,624 38,312 19,156 9,578 4,789 14,368 7,184 3,592 1,796 898 449 1,348

← Previous Integer #7,644,279 Browse Full Index Next Integer #7,644,281 →