4,330,755

3² × 5 × 11 × 13 × 673

4,330,755 factors as 3^2 × 5 × 11 × 13 × 673. Its 48 positive divisors give a proper-divisor sum of 4,501,341, so this integer is abundant. The Collatz stopping time is 211 steps.

Prime Factor Structure

Factorization String 3^2 × 5 × 11 × 13 × 673

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 8,832,096

Proper Divisor Sum 4,501,341

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #4330717 ← → #4330757

Radix Representation

Decimal	4330755
Binary	10000100001010100000011 (23 bits)
Octal	0o20412403
Hexadecimal	0x421503

Divisor Catalog (48)

1 3 5 9 11 13 15 33 39 45 55 65 99 117 143 165 195 429 495 585 673 715 1,287 2,019 2,145 3,365 6,057 6,435 7,403 8,749 10,095 22,209 26,247 30,285 37,015 43,745 66,627 78,741 96,239 111,045 131,235 288,717 333,135 393,705 481,195 866,151 1,443,585 4,330,755

Collatz Trajectory (211 steps to reach 1)

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

4,330,755 12,992,266 6,496,133 19,488,400 9,744,200 4,872,100 2,436,050 1,218,025 3,654,076 1,827,038 913,519 2,740,558 1,370,279 4,110,838 2,055,419 6,166,258 3,083,129 9,249,388 4,624,694 2,312,347 6,937,042 3,468,521 10,405,564 5,202,782 2,601,391 7,804,174 3,902,087 11,706,262 5,853,131 17,559,394 8,779,697 26,339,092 13,169,546 6,584,773 19,754,320 9,877,160 4,938,580 2,469,290 1,234,645 3,703,936 1,851,968 925,984 462,992 231,496 115,748 57,874 28,937 86,812 43,406 21,703 65,110 32,555 97,666 48,833 146,500 73,250 36,625 109,876 54,938 27,469

← Previous Integer #4,330,754 Browse Full Index Next Integer #4,330,756 →