4,397,226

2 × 3 × 31 × 47 × 503

4,397,226 factors as 2 × 3 × 31 × 47 × 503. Its 32 positive divisors give a proper-divisor sum of 4,892,502, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2 × 3 × 31 × 47 × 503

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,289,728

Proper Divisor Sum 4,892,502

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4397207 ← → #4397233

Radix Representation

Decimal	4397226
Binary	10000110001100010101010 (23 bits)
Octal	0o20614252
Hexadecimal	0x4318AA

Divisor Catalog (32)

1 2 3 6 31 47 62 93 94 141 186 282 503 1,006 1,457 1,509 2,914 3,018 4,371 8,742 15,593 23,641 31,186 46,779 47,282 70,923 93,558 141,846 732,871 1,465,742 2,198,613 4,397,226

Collatz Trajectory (136 steps to reach 1)

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

4,397,226 2,198,613 6,595,840 3,297,920 1,648,960 824,480 412,240 206,120 103,060 51,530 25,765 77,296 38,648 19,324 9,662 4,831 14,494 7,247 21,742 10,871 32,614 16,307 48,922 24,461 73,384 36,692 18,346 9,173 27,520 13,760 6,880 3,440 1,720 860 430 215 646 323 970 485 1,456 728 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790

← Previous Integer #4,397,225 Browse Full Index Next Integer #4,397,227 →