2,878,434

2 × 3² × 13 × 12301

2,878,434 factors as 2 × 3^2 × 13 × 12301. Its 24 positive divisors give a proper-divisor sum of 3,838,458, so this integer is abundant. The Collatz stopping time is 76 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 13 × 12301

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 6,716,892

Proper Divisor Sum 3,838,458

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #2878429 ← → #2878439

Radix Representation

Decimal	2878434
Binary	1010111110101111100010 (22 bits)
Octal	0o12765742
Hexadecimal	0x2BEBE2

Divisor Catalog (24)

Collatz Trajectory (76 steps to reach 1)

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

2,878,434 1,439,217 4,317,652 2,158,826 1,079,413 3,238,240 1,619,120 809,560 404,780 202,390 101,195 303,586 151,793 455,380 227,690 113,845 341,536 170,768 85,384 42,692 21,346 10,673 32,020 16,010 8,005 24,016 12,008 6,004 3,002 1,501 4,504 2,252 1,126 563 1,690 845 2,536 1,268 634 317 952 476 238 119 358 179 538 269 808 404 202 101 304 152 76 38 19 58 29 88

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,878,433 Browse Full Index Next Integer #2,878,435 →