2,229,702

2 × 3 × 371617

2,229,702 factors as 2 × 3 × 371617. Its 8 positive divisors give a proper-divisor sum of 2,229,714, so this integer is abundant. The Collatz stopping time is 148 steps.

Prime Factor Structure

Factorization String 2 × 3 × 371617

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,459,416

Proper Divisor Sum 2,229,714

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2229701 ← → #2229713

Radix Representation

Decimal	2229702
Binary	1000100000010111000110 (22 bits)
Octal	0o10402706
Hexadecimal	0x2205C6

Divisor Catalog (8)

1 2 3 6 371,617 743,234 1,114,851 2,229,702

Collatz Trajectory (148 steps to reach 1)

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

2,229,702 1,114,851 3,344,554 1,672,277 5,016,832 2,508,416 1,254,208 627,104 313,552 156,776 78,388 39,194 19,597 58,792 29,396 14,698 7,349 22,048 11,024 5,512 2,756 1,378 689 2,068 1,034 517 1,552 776 388 194 97 292 146 73 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412

← Previous Integer #2,229,701 Browse Full Index Next Integer #2,229,703 →