4,774,074

2 × 3 × 795679

4,774,074 factors as 2 × 3 × 795679. Its 8 positive divisors give a proper-divisor sum of 4,774,086, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2 × 3 × 795679

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 9,548,160

Proper Divisor Sum 4,774,086

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #4774069 ← → #4774123

Radix Representation

Decimal	4774074
Binary	10010001101100010111010 (23 bits)
Octal	0o22154272
Hexadecimal	0x48D8BA

Divisor Catalog (8)

1 2 3 6 795,679 1,591,358 2,387,037 4,774,074

Collatz Trajectory (69 steps to reach 1)

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

4,774,074 2,387,037 7,161,112 3,580,556 1,790,278 895,139 2,685,418 1,342,709 4,028,128 2,014,064 1,007,032 503,516 251,758 125,879 377,638 188,819 566,458 283,229 849,688 424,844 212,422 106,211 318,634 159,317 477,952 238,976 119,488 59,744 29,872 14,936 7,468 3,734 1,867 5,602 2,801 8,404 4,202 2,101 6,304 3,152 1,576 788 394 197 592 296 148 74 37 112 56 28 14 7 22 11 34 17 52 26

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,774,073 Browse Full Index Next Integer #4,774,075 →