3,141,774

2 × 3³ × 73 × 797

3,141,774 factors as 2 × 3^3 × 73 × 797. Its 32 positive divisors give a proper-divisor sum of 3,944,466, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 73 × 797

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 7,086,240

Proper Divisor Sum 3,944,466

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #3141769 ← → #3141811

Radix Representation

Decimal	3141774
Binary	1011111111000010001110 (22 bits)
Octal	0o13770216
Hexadecimal	0x2FF08E

Divisor Catalog (32)

1 2 3 6 9 18 27 54 73 146 219 438 657 797 1,314 1,594 1,971 2,391 3,942 4,782 7,173 14,346 21,519 43,038 58,181 116,362 174,543 349,086 523,629 1,047,258 1,570,887 3,141,774

Collatz Trajectory (164 steps to reach 1)

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

3,141,774 1,570,887 4,712,662 2,356,331 7,068,994 3,534,497 10,603,492 5,301,746 2,650,873 7,952,620 3,976,310 1,988,155 5,964,466 2,982,233 8,946,700 4,473,350 2,236,675 6,710,026 3,355,013 10,065,040 5,032,520 2,516,260 1,258,130 629,065 1,887,196 943,598 471,799 1,415,398 707,699 2,123,098 1,061,549 3,184,648 1,592,324 796,162 398,081 1,194,244 597,122 298,561 895,684 447,842 223,921 671,764 335,882 167,941 503,824 251,912 125,956 62,978 31,489 94,468 47,234 23,617 70,852 35,426 17,713 53,140 26,570 13,285 39,856 19,928

← Previous Integer #3,141,773 Browse Full Index Next Integer #3,141,775 →