7,152,320

2⁶ × 5 × 7 × 31 × 103

7,152,320 factors as 2^6 × 5 × 7 × 31 × 103. Its 112 positive divisors give a proper-divisor sum of 13,135,168, so this integer is abundant. The Collatz stopping time is 98 steps.

Prime Factor Structure

Factorization String 2^6 × 5 × 7 × 31 × 103

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 112

Divisor Sum (σ) 20,287,488

Proper Divisor Sum 13,135,168

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #7152283 ← → #7152323

Radix Representation

Decimal	7152320
Binary	11011010010001011000000 (23 bits)
Octal	0o33221300
Hexadecimal	0x6D22C0

Divisor Catalog (60 of 112)

1 2 4 5 7 8 10 14 16 20 28 31 32 35 40 56 62 64 70 80 103 112 124 140 155 160 206 217 224 248 280 310 320 412 434 448 496 515 560 620 721 824 868 992 1,030 1,085 1,120 1,240 1,442 1,648 1,736 1,984 2,060 2,170 2,240 2,480 2,884 3,193 3,296 3,472

Collatz Trajectory (98 steps to reach 1)

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

7,152,320 3,576,160 1,788,080 894,040 447,020 223,510 111,755 335,266 167,633 502,900 251,450 125,725 377,176 188,588 94,294 47,147 141,442 70,721 212,164 106,082 53,041 159,124 79,562 39,781 119,344 59,672 29,836 14,918 7,459 22,378 11,189 33,568 16,784 8,392 4,196 2,098 1,049 3,148 1,574 787 2,362 1,181 3,544 1,772 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211

← Previous Integer #7,152,319 Browse Full Index Next Integer #7,152,321 →