9,665,669

13 × 43 × 17291

9,665,669 factors as 13 × 43 × 17291. Its 8 positive divisors give a proper-divisor sum of 986,203, so this integer is deficient. The Collatz stopping time is 269 steps.

Prime Factor Structure

Factorization String 13 × 43 × 17291

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 10,651,872

Proper Divisor Sum 986,203

Digit Sum / Digital Root 47 (Root: 2)

Adjacent Primes #9665657 ← → #9665701

Radix Representation

Decimal	9665669
Binary	100100110111110010000101 (24 bits)
Octal	0o44676205
Hexadecimal	0x937C85

Divisor Catalog (8)

1 13 43 559 17,291 224,783 743,513 9,665,669

Collatz Trajectory (269 steps to reach 1)

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

9,665,669 28,997,008 14,498,504 7,249,252 3,624,626 1,812,313 5,436,940 2,718,470 1,359,235 4,077,706 2,038,853 6,116,560 3,058,280 1,529,140 764,570 382,285 1,146,856 573,428 286,714 143,357 430,072 215,036 107,518 53,759 161,278 80,639 241,918 120,959 362,878 181,439 544,318 272,159 816,478 408,239 1,224,718 612,359 1,837,078 918,539 2,755,618 1,377,809 4,133,428 2,066,714 1,033,357 3,100,072 1,550,036 775,018 387,509 1,162,528 581,264 290,632 145,316 72,658 36,329 108,988 54,494 27,247 81,742 40,871 122,614 61,307

← Previous Integer #9,665,668 Browse Full Index Next Integer #9,665,670 →