4,164,366

2 × 3 × 694061

4,164,366 factors as 2 × 3 × 694061. Its 8 positive divisors give a proper-divisor sum of 4,164,378, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2 × 3 × 694061

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,328,744

Proper Divisor Sum 4,164,378

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4164343 ← → #4164367

Radix Representation

Decimal	4164366
Binary	1111111000101100001110 (22 bits)
Octal	0o17705416
Hexadecimal	0x3F8B0E

Divisor Catalog (8)

1 2 3 6 694,061 1,388,122 2,082,183 4,164,366

Collatz Trajectory (136 steps to reach 1)

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

4,164,366 2,082,183 6,246,550 3,123,275 9,369,826 4,684,913 14,054,740 7,027,370 3,513,685 10,541,056 5,270,528 2,635,264 1,317,632 658,816 329,408 164,704 82,352 41,176 20,588 10,294 5,147 15,442 7,721 23,164 11,582 5,791 17,374 8,687 26,062 13,031 39,094 19,547 58,642 29,321 87,964 43,982 21,991 65,974 32,987 98,962 49,481 148,444 74,222 37,111 111,334 55,667 167,002 83,501 250,504 125,252 62,626 31,313 93,940 46,970 23,485 70,456 35,228 17,614 8,807 26,422

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,164,365 Browse Full Index Next Integer #4,164,367 →