3,667,253

29 × 126457

3,667,253 factors as 29 × 126457. Its 4 positive divisors give a proper-divisor sum of 126,487, so this integer is deficient. The Collatz stopping time is 203 steps.

Prime Factor Structure

Factorization String 29 × 126457

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 3,793,740

Proper Divisor Sum 126,487

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #3667249 ← → #3667273

Radix Representation

Decimal	3667253
Binary	1101111111010100110101 (22 bits)
Octal	0o15772465
Hexadecimal	0x37F535

Divisor Catalog (4)

1 29 126,457 3,667,253

Collatz Trajectory (203 steps to reach 1)

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

3,667,253 11,001,760 5,500,880 2,750,440 1,375,220 687,610 343,805 1,031,416 515,708 257,854 128,927 386,782 193,391 580,174 290,087 870,262 435,131 1,305,394 652,697 1,958,092 979,046 489,523 1,468,570 734,285 2,202,856 1,101,428 550,714 275,357 826,072 413,036 206,518 103,259 309,778 154,889 464,668 232,334 116,167 348,502 174,251 522,754 261,377 784,132 392,066 196,033 588,100 294,050 147,025 441,076 220,538 110,269 330,808 165,404 82,702 41,351 124,054 62,027 186,082 93,041 279,124 139,562

← Previous Integer #3,667,252 Browse Full Index Next Integer #3,667,254 →