4,447,302

2 × 3 × 17 × 59 × 739

4,447,302 factors as 2 × 3 × 17 × 59 × 739. Its 32 positive divisors give a proper-divisor sum of 5,143,098, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17 × 59 × 739

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,590,400

Proper Divisor Sum 5,143,098

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4447301 ← → #4447321

Radix Representation

Decimal	4447302
Binary	10000111101110001000110 (23 bits)
Octal	0o20756106
Hexadecimal	0x43DC46

Divisor Catalog (32)

1 2 3 6 17 34 51 59 102 118 177 354 739 1,003 1,478 2,006 2,217 3,009 4,434 6,018 12,563 25,126 37,689 43,601 75,378 87,202 130,803 261,606 741,217 1,482,434 2,223,651 4,447,302

Collatz Trajectory (167 steps to reach 1)

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

4,447,302 2,223,651 6,670,954 3,335,477 10,006,432 5,003,216 2,501,608 1,250,804 625,402 312,701 938,104 469,052 234,526 117,263 351,790 175,895 527,686 263,843 791,530 395,765 1,187,296 593,648 296,824 148,412 74,206 37,103 111,310 55,655 166,966 83,483 250,450 125,225 375,676 187,838 93,919 281,758 140,879 422,638 211,319 633,958 316,979 950,938 475,469 1,426,408 713,204 356,602 178,301 534,904 267,452 133,726 66,863 200,590 100,295 300,886 150,443 451,330 225,665 676,996 338,498 169,249

← Previous Integer #4,447,301 Browse Full Index Next Integer #4,447,303 →