2,914,136

2³ × 364267

2,914,136 factors as 2^3 × 364267. Its 8 positive divisors give a proper-divisor sum of 2,549,884, so this integer is deficient. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 2^3 × 364267

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,464,020

Proper Divisor Sum 2,549,884

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #2914133 ← → #2914139

Radix Representation

Decimal	2914136
Binary	1011000111011101011000 (22 bits)
Octal	0o13073530
Hexadecimal	0x2C7758

Divisor Catalog (8)

1 2 4 8 364,267 728,534 1,457,068 2,914,136

Collatz Trajectory (138 steps to reach 1)

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

2,914,136 1,457,068 728,534 364,267 1,092,802 546,401 1,639,204 819,602 409,801 1,229,404 614,702 307,351 922,054 461,027 1,383,082 691,541 2,074,624 1,037,312 518,656 259,328 129,664 64,832 32,416 16,208 8,104 4,052 2,026 1,013 3,040 1,520 760 380 190 95 286 143 430 215 646 323 970 485 1,456 728 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,914,135 Browse Full Index Next Integer #2,914,137 →