4,431,228

2² × 3 × 369269

4,431,228 factors as 2^2 × 3 × 369269. Its 12 positive divisors give a proper-divisor sum of 5,908,332, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 369269

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,339,560

Proper Divisor Sum 5,908,332

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4431227 ← → #4431241

Radix Representation

Decimal	4431228
Binary	10000111001110101111100 (23 bits)
Octal	0o20716574
Hexadecimal	0x439D7C

Divisor Catalog (12)

1 2 3 4 6 12 369,269 738,538 1,107,807 1,477,076 2,215,614 4,431,228

Collatz Trajectory (61 steps to reach 1)

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

4,431,228 2,215,614 1,107,807 3,323,422 1,661,711 4,985,134 2,492,567 7,477,702 3,738,851 11,216,554 5,608,277 16,824,832 8,412,416 4,206,208 2,103,104 1,051,552 525,776 262,888 131,444 65,722 32,861 98,584 49,292 24,646 12,323 36,970 18,485 55,456 27,728 13,864 6,932 3,466 1,733 5,200 2,600 1,300 650 325 976 488 244 122 61 184 92 46 23 70 35 106 53 160 80 40 20 10 5 16 8 4

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,431,227 Browse Full Index Next Integer #4,431,229 →