4,028,994

2 × 3³ × 74611

4,028,994 factors as 2 × 3^3 × 74611. Its 16 positive divisors give a proper-divisor sum of 4,924,446, so this integer is abundant. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 74611

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,953,440

Proper Divisor Sum 4,924,446

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4028993 ← → #4029001

Radix Representation

Decimal	4028994
Binary	1111010111101001000010 (22 bits)
Octal	0o17275102
Hexadecimal	0x3D7A42

Divisor Catalog (16)

1 2 3 6 9 18 27 54 74,611 149,222 223,833 447,666 671,499 1,342,998 2,014,497 4,028,994

Collatz Trajectory (92 steps to reach 1)

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

4,028,994 2,014,497 6,043,492 3,021,746 1,510,873 4,532,620 2,266,310 1,133,155 3,399,466 1,699,733 5,099,200 2,549,600 1,274,800 637,400 318,700 159,350 79,675 239,026 119,513 358,540 179,270 89,635 268,906 134,453 403,360 201,680 100,840 50,420 25,210 12,605 37,816 18,908 9,454 4,727 14,182 7,091 21,274 10,637 31,912 15,956 7,978 3,989 11,968 5,984 2,992 1,496 748 374 187 562 281 844 422 211 634 317 952 476 238 119

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,028,993 Browse Full Index Next Integer #4,028,995 →