9,006,669

3² × 7 × 142963

9,006,669 factors as 3^2 × 7 × 142963. Its 12 positive divisors give a proper-divisor sum of 5,861,587, so this integer is deficient. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 3^2 × 7 × 142963

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 14,868,256

Proper Divisor Sum 5,861,587

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9006659 ← → #9006671

Radix Representation

Decimal	9006669
Binary	100010010110111001001101 (24 bits)
Octal	0o42267115
Hexadecimal	0x896E4D

Divisor Catalog (12)

1 3 7 9 21 63 142,963 428,889 1,000,741 1,286,667 3,002,223 9,006,669

Collatz Trajectory (88 steps to reach 1)

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

9,006,669 27,020,008 13,510,004 6,755,002 3,377,501 10,132,504 5,066,252 2,533,126 1,266,563 3,799,690 1,899,845 5,699,536 2,849,768 1,424,884 712,442 356,221 1,068,664 534,332 267,166 133,583 400,750 200,375 601,126 300,563 901,690 450,845 1,352,536 676,268 338,134 169,067 507,202 253,601 760,804 380,402 190,201 570,604 285,302 142,651 427,954 213,977 641,932 320,966 160,483 481,450 240,725 722,176 361,088 180,544 90,272 45,136 22,568 11,284 5,642 2,821 8,464 4,232 2,116 1,058 529 1,588

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