4,062,136

2³ × 13 × 139 × 281

4,062,136 factors as 2^3 × 13 × 139 × 281. Its 32 positive divisors give a proper-divisor sum of 4,228,664, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 139 × 281

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 8,290,800

Proper Divisor Sum 4,228,664

Digit Sum / Digital Root 22 (Root: 4)

Adjacent Primes #4062131 ← → #4062139

Radix Representation

Decimal	4062136
Binary	1111011111101110111000 (22 bits)
Octal	0o17375670
Hexadecimal	0x3DFBB8

Divisor Catalog (32)

Collatz Trajectory (84 steps to reach 1)

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

4,062,136 2,031,068 1,015,534 507,767 1,523,302 761,651 2,284,954 1,142,477 3,427,432 1,713,716 856,858 428,429 1,285,288 642,644 321,322 160,661 481,984 240,992 120,496 60,248 30,124 15,062 7,531 22,594 11,297 33,892 16,946 8,473 25,420 12,710 6,355 19,066 9,533 28,600 14,300 7,150 3,575 10,726 5,363 16,090 8,045 24,136 12,068 6,034 3,017 9,052 4,526 2,263 6,790 3,395 10,186 5,093 15,280 7,640 3,820 1,910 955 2,866 1,433 4,300

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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