4,493,796

2² × 3 × 374483

4,493,796 factors as 2^2 × 3 × 374483. Its 12 positive divisors give a proper-divisor sum of 5,991,756, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 374483

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 10,485,552

Proper Divisor Sum 5,991,756

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #4493789 ← → #4493813

Radix Representation

Decimal	4493796
Binary	10001001001000111100100 (23 bits)
Octal	0o21110744
Hexadecimal	0x4491E4

Divisor Catalog (12)

1 2 3 4 6 12 374,483 748,966 1,123,449 1,497,932 2,246,898 4,493,796

Collatz Trajectory (74 steps to reach 1)

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

4,493,796 2,246,898 1,123,449 3,370,348 1,685,174 842,587 2,527,762 1,263,881 3,791,644 1,895,822 947,911 2,843,734 1,421,867 4,265,602 2,132,801 6,398,404 3,199,202 1,599,601 4,798,804 2,399,402 1,199,701 3,599,104 1,799,552 899,776 449,888 224,944 112,472 56,236 28,118 14,059 42,178 21,089 63,268 31,634 15,817 47,452 23,726 11,863 35,590 17,795 53,386 26,693 80,080 40,040 20,020 10,010 5,005 15,016 7,508 3,754 1,877 5,632 2,816 1,408 704 352 176 88 44 22

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,493,795 Browse Full Index Next Integer #4,493,797 →