2,267,328

2⁶ × 3 × 7² × 241

2,267,328 factors as 2^6 × 3 × 7^2 × 241. Its 84 positive divisors give a proper-divisor sum of 4,740,024, so this integer is abundant. The Collatz stopping time is 117 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 7^2 × 241

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 84

Divisor Sum (σ) 7,007,352

Proper Divisor Sum 4,740,024

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #2267303 ← → #2267381

Radix Representation

Decimal	2267328
Binary	1000101001100011000000 (22 bits)
Octal	0o10514300
Hexadecimal	0x2298C0

Divisor Catalog (60 of 84)

1 2 3 4 6 7 8 12 14 16 21 24 28 32 42 48 49 56 64 84 96 98 112 147 168 192 196 224 241 294 336 392 448 482 588 672 723 784 964 1,176 1,344 1,446 1,568 1,687 1,928 2,352 2,892 3,136 3,374 3,856 4,704 5,061 5,784 6,748 7,712 9,408 10,122 11,568 11,809 13,496

Collatz Trajectory (117 steps to reach 1)

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

2,267,328 1,133,664 566,832 283,416 141,708 70,854 35,427 106,282 53,141 159,424 79,712 39,856 19,928 9,964 4,982 2,491 7,474 3,737 11,212 5,606 2,803 8,410 4,205 12,616 6,308 3,154 1,577 4,732 2,366 1,183 3,550 1,775 5,326 2,663 7,990 3,995 11,986 5,993 17,980 8,990 4,495 13,486 6,743 20,230 10,115 30,346 15,173 45,520 22,760 11,380 5,690 2,845 8,536 4,268 2,134 1,067 3,202 1,601 4,804 2,402

← Previous Integer #2,267,327 Browse Full Index Next Integer #2,267,329 →