4,064,136

2³ × 3 × 169339

4,064,136 factors as 2^3 × 3 × 169339. Its 16 positive divisors give a proper-divisor sum of 6,096,264, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 169339

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,160,400

Proper Divisor Sum 6,096,264

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4064113 ← → #4064141

Radix Representation

Decimal	4064136
Binary	1111100000001110001000 (22 bits)
Octal	0o17401610
Hexadecimal	0x3E0388

Divisor Catalog (16)

1 2 3 4 6 8 12 24 169,339 338,678 508,017 677,356 1,016,034 1,354,712 2,032,068 4,064,136

Collatz Trajectory (61 steps to reach 1)

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

4,064,136 2,032,068 1,016,034 508,017 1,524,052 762,026 381,013 1,143,040 571,520 285,760 142,880 71,440 35,720 17,860 8,930 4,465 13,396 6,698 3,349 10,048 5,024 2,512 1,256 628 314 157 472 236 118 59 178 89 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,064,135 Browse Full Index Next Integer #4,064,137 →