4,465,776

2⁴ × 3 × 7 × 13291

4,465,776 factors as 2^4 × 3 × 7 × 13291. Its 40 positive divisors give a proper-divisor sum of 8,719,888, so this integer is abundant. The Collatz stopping time is 180 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 7 × 13291

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 13,185,664

Proper Divisor Sum 8,719,888

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4465763 ← → #4465787

Radix Representation

Decimal	4465776
Binary	10001000010010001110000 (23 bits)
Octal	0o21022160
Hexadecimal	0x442470

Divisor Catalog (40)

1 2 3 4 6 7 8 12 14 16 21 24 28 42 48 56 84 112 168 336 13,291 26,582 39,873 53,164 79,746 93,037 106,328 159,492 186,074 212,656 279,111 318,984 372,148 558,222 637,968 744,296 1,116,444 1,488,592 2,232,888 4,465,776

Collatz Trajectory (180 steps to reach 1)

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

4,465,776 2,232,888 1,116,444 558,222 279,111 837,334 418,667 1,256,002 628,001 1,884,004 942,002 471,001 1,413,004 706,502 353,251 1,059,754 529,877 1,589,632 794,816 397,408 198,704 99,352 49,676 24,838 12,419 37,258 18,629 55,888 27,944 13,972 6,986 3,493 10,480 5,240 2,620 1,310 655 1,966 983 2,950 1,475 4,426 2,213 6,640 3,320 1,660 830 415 1,246 623 1,870 935 2,806 1,403 4,210 2,105 6,316 3,158 1,579 4,738

← Previous Integer #4,465,775 Browse Full Index Next Integer #4,465,777 →