9,167,004

2² × 3² × 7 × 11 × 3307

9,167,004 factors as 2^2 × 3^2 × 7 × 11 × 3307. Its 72 positive divisors give a proper-divisor sum of 19,731,684, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 7 × 11 × 3307

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 28,898,688

Proper Divisor Sum 19,731,684

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9167003 ← → #9167017

Radix Representation

Decimal	9167004
Binary	100010111110000010011100 (24 bits)
Octal	0o42760234
Hexadecimal	0x8BE09C

Divisor Catalog (60 of 72)

1 2 3 4 6 7 9 11 12 14 18 21 22 28 33 36 42 44 63 66 77 84 99 126 132 154 198 231 252 308 396 462 693 924 1,386 2,772 3,307 6,614 9,921 13,228 19,842 23,149 29,763 36,377 39,684 46,298 59,526 69,447 72,754 92,596 109,131 119,052 138,894 145,508 208,341 218,262 254,639 277,788 327,393 416,682

Collatz Trajectory (132 steps to reach 1)

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

9,167,004 4,583,502 2,291,751 6,875,254 3,437,627 10,312,882 5,156,441 15,469,324 7,734,662 3,867,331 11,601,994 5,800,997 17,402,992 8,701,496 4,350,748 2,175,374 1,087,687 3,263,062 1,631,531 4,894,594 2,447,297 7,341,892 3,670,946 1,835,473 5,506,420 2,753,210 1,376,605 4,129,816 2,064,908 1,032,454 516,227 1,548,682 774,341 2,323,024 1,161,512 580,756 290,378 145,189 435,568 217,784 108,892 54,446 27,223 81,670 40,835 122,506 61,253 183,760 91,880 45,940 22,970 11,485 34,456 17,228 8,614 4,307 12,922 6,461 19,384 9,692

← Previous Integer #9,167,003 Browse Full Index Next Integer #9,167,005 →