4,490,841

3 × 541 × 2767

4,490,841 factors as 3 × 541 × 2767. Its 8 positive divisors give a proper-divisor sum of 1,510,183, so this integer is deficient. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 3 × 541 × 2767

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,001,024

Proper Divisor Sum 1,510,183

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4490831 ← → #4490861

Radix Representation

Decimal	4490841
Binary	10001001000011001011001 (23 bits)
Octal	0o21103131
Hexadecimal	0x448659

Divisor Catalog (8)

1 3 541 1,623 2,767 8,301 1,496,947 4,490,841

Collatz Trajectory (87 steps to reach 1)

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

4,490,841 13,472,524 6,736,262 3,368,131 10,104,394 5,052,197 15,156,592 7,578,296 3,789,148 1,894,574 947,287 2,841,862 1,420,931 4,262,794 2,131,397 6,394,192 3,197,096 1,598,548 799,274 399,637 1,198,912 599,456 299,728 149,864 74,932 37,466 18,733 56,200 28,100 14,050 7,025 21,076 10,538 5,269 15,808 7,904 3,952 1,976 988 494 247 742 371 1,114 557 1,672 836 418 209 628 314 157 472 236 118 59 178 89 268 134

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,490,840 Browse Full Index Next Integer #4,490,842 →