4,281,432

2³ × 3 × 178393

4,281,432 factors as 2^3 × 3 × 178393. Its 16 positive divisors give a proper-divisor sum of 6,422,208, so this integer is abundant. The Collatz stopping time is 123 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 178393

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,703,640

Proper Divisor Sum 6,422,208

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4281413 ← → #4281439

Radix Representation

Decimal	4281432
Binary	10000010101010001011000 (23 bits)
Octal	0o20252130
Hexadecimal	0x415458

Divisor Catalog (16)

1 2 3 4 6 8 12 24 178,393 356,786 535,179 713,572 1,070,358 1,427,144 2,140,716 4,281,432

Collatz Trajectory (123 steps to reach 1)

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

4,281,432 2,140,716 1,070,358 535,179 1,605,538 802,769 2,408,308 1,204,154 602,077 1,806,232 903,116 451,558 225,779 677,338 338,669 1,016,008 508,004 254,002 127,001 381,004 190,502 95,251 285,754 142,877 428,632 214,316 107,158 53,579 160,738 80,369 241,108 120,554 60,277 180,832 90,416 45,208 22,604 11,302 5,651 16,954 8,477 25,432 12,716 6,358 3,179 9,538 4,769 14,308 7,154 3,577 10,732 5,366 2,683 8,050 4,025 12,076 6,038 3,019 9,058 4,529

← Previous Integer #4,281,431 Browse Full Index Next Integer #4,281,433 →