3,556,398

2 × 3 × 23 × 25771

3,556,398 factors as 2 × 3 × 23 × 25771. Its 16 positive divisors give a proper-divisor sum of 3,865,938, so this integer is abundant. The Collatz stopping time is 146 steps.

Prime Factor Structure

Factorization String 2 × 3 × 23 × 25771

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,422,336

Proper Divisor Sum 3,865,938

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3556393 ← → #3556447

Radix Representation

Decimal	3556398
Binary	1101100100010000101110 (22 bits)
Octal	0o15442056
Hexadecimal	0x36442E

Divisor Catalog (16)

1 2 3 6 23 46 69 138 25,771 51,542 77,313 154,626 592,733 1,185,466 1,778,199 3,556,398

Collatz Trajectory (146 steps to reach 1)

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

3,556,398 1,778,199 5,334,598 2,667,299 8,001,898 4,000,949 12,002,848 6,001,424 3,000,712 1,500,356 750,178 375,089 1,125,268 562,634 281,317 843,952 421,976 210,988 105,494 52,747 158,242 79,121 237,364 118,682 59,341 178,024 89,012 44,506 22,253 66,760 33,380 16,690 8,345 25,036 12,518 6,259 18,778 9,389 28,168 14,084 7,042 3,521 10,564 5,282 2,641 7,924 3,962 1,981 5,944 2,972 1,486 743 2,230 1,115 3,346 1,673 5,020 2,510 1,255 3,766

← Previous Integer #3,556,397 Browse Full Index Next Integer #3,556,399 →