4,755,504

2⁴ × 3 × 13 × 7621

4,755,504 factors as 2^4 × 3 × 13 × 7621. Its 40 positive divisors give a proper-divisor sum of 8,476,288, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 13 × 7621

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 13,231,792

Proper Divisor Sum 8,476,288

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4755497 ← → #4755511

Radix Representation

Decimal	4755504
Binary	10010001001000000110000 (23 bits)
Octal	0o22110060
Hexadecimal	0x489030

Divisor Catalog (40)

1 2 3 4 6 8 12 13 16 24 26 39 48 52 78 104 156 208 312 624 7,621 15,242 22,863 30,484 45,726 60,968 91,452 99,073 121,936 182,904 198,146 297,219 365,808 396,292 594,438 792,584 1,188,876 1,585,168 2,377,752 4,755,504

Collatz Trajectory (74 steps to reach 1)

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

4,755,504 2,377,752 1,188,876 594,438 297,219 891,658 445,829 1,337,488 668,744 334,372 167,186 83,593 250,780 125,390 62,695 188,086 94,043 282,130 141,065 423,196 211,598 105,799 317,398 158,699 476,098 238,049 714,148 357,074 178,537 535,612 267,806 133,903 401,710 200,855 602,566 301,283 903,850 451,925 1,355,776 677,888 338,944 169,472 84,736 42,368 21,184 10,592 5,296 2,648 1,324 662 331 994 497 1,492 746 373 1,120 560 280 140

← Previous Integer #4,755,503 Browse Full Index Next Integer #4,755,505 →