4,366,146

2 × 3 × 727691

4,366,146 factors as 2 × 3 × 727691. Its 8 positive divisors give a proper-divisor sum of 4,366,158, so this integer is abundant. The Collatz stopping time is 118 steps.

Prime Factor Structure

Factorization String 2 × 3 × 727691

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,732,304

Proper Divisor Sum 4,366,158

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4366123 ← → #4366163

Radix Representation

Decimal	4366146
Binary	10000101001111101000010 (23 bits)
Octal	0o20517502
Hexadecimal	0x429F42

Divisor Catalog (8)

1 2 3 6 727,691 1,455,382 2,183,073 4,366,146

Collatz Trajectory (118 steps to reach 1)

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

4,366,146 2,183,073 6,549,220 3,274,610 1,637,305 4,911,916 2,455,958 1,227,979 3,683,938 1,841,969 5,525,908 2,762,954 1,381,477 4,144,432 2,072,216 1,036,108 518,054 259,027 777,082 388,541 1,165,624 582,812 291,406 145,703 437,110 218,555 655,666 327,833 983,500 491,750 245,875 737,626 368,813 1,106,440 553,220 276,610 138,305 414,916 207,458 103,729 311,188 155,594 77,797 233,392 116,696 58,348 29,174 14,587 43,762 21,881 65,644 32,822 16,411 49,234 24,617 73,852 36,926 18,463 55,390 27,695

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,366,145 Browse Full Index Next Integer #4,366,147 →