4,191,954

2 × 3 × 13 × 223 × 241

4,191,954 factors as 2 × 3 × 13 × 223 × 241. Its 32 positive divisors give a proper-divisor sum of 4,914,990, so this integer is abundant. The Collatz stopping time is 180 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 223 × 241

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,106,944

Proper Divisor Sum 4,914,990

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4191953 ← → #4191973

Radix Representation

Decimal	4191954
Binary	1111111111011011010010 (22 bits)
Octal	0o17773322
Hexadecimal	0x3FF6D2

Divisor Catalog (32)

1 2 3 6 13 26 39 78 223 241 446 482 669 723 1,338 1,446 2,899 3,133 5,798 6,266 8,697 9,399 17,394 18,798 53,743 107,486 161,229 322,458 698,659 1,397,318 2,095,977 4,191,954

Collatz Trajectory (180 steps to reach 1)

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

4,191,954 2,095,977 6,287,932 3,143,966 1,571,983 4,715,950 2,357,975 7,073,926 3,536,963 10,610,890 5,305,445 15,916,336 7,958,168 3,979,084 1,989,542 994,771 2,984,314 1,492,157 4,476,472 2,238,236 1,119,118 559,559 1,678,678 839,339 2,518,018 1,259,009 3,777,028 1,888,514 944,257 2,832,772 1,416,386 708,193 2,124,580 1,062,290 531,145 1,593,436 796,718 398,359 1,195,078 597,539 1,792,618 896,309 2,688,928 1,344,464 672,232 336,116 168,058 84,029 252,088 126,044 63,022 31,511 94,534 47,267 141,802 70,901 212,704 106,352 53,176 26,588

← Previous Integer #4,191,953 Browse Full Index Next Integer #4,191,955 →