4,493,748

2² × 3 × 7 × 61 × 877

4,493,748 factors as 2^2 × 3 × 7 × 61 × 877. Its 48 positive divisors give a proper-divisor sum of 7,699,916, so this integer is abundant. The Collatz stopping time is 211 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 61 × 877

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 12,193,664

Proper Divisor Sum 7,699,916

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4493707 ← → #4493759

Radix Representation

Decimal	4493748
Binary	10001001001000110110100 (23 bits)
Octal	0o21110664
Hexadecimal	0x4491B4

Divisor Catalog (48)

Collatz Trajectory (211 steps to reach 1)

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

4,493,748 2,246,874 1,123,437 3,370,312 1,685,156 842,578 421,289 1,263,868 631,934 315,967 947,902 473,951 1,421,854 710,927 2,132,782 1,066,391 3,199,174 1,599,587 4,798,762 2,399,381 7,198,144 3,599,072 1,799,536 899,768 449,884 224,942 112,471 337,414 168,707 506,122 253,061 759,184 379,592 189,796 94,898 47,449 142,348 71,174 35,587 106,762 53,381 160,144 80,072 40,036 20,018 10,009 30,028 15,014 7,507 22,522 11,261 33,784 16,892 8,446 4,223 12,670 6,335 19,006 9,503 28,510

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,493,747 Browse Full Index Next Integer #4,493,749 →