29,686,554

2 × 3³ × 549751

29,686,554 factors as 2 × 3^3 × 549751. Its 16 positive divisors give a proper-divisor sum of 36,283,686, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 549751

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 65,970,240

Proper Divisor Sum 36,283,686

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #29686513 ← → #29686567

Radix Representation

Decimal	29686554
Binary	1110001001111101100011010 (25 bits)
Octal	0o161175432
Hexadecimal	0x1C4FB1A

Divisor Catalog (16)

1 2 3 6 9 18 27 54 549,751 1,099,502 1,649,253 3,298,506 4,947,759 9,895,518 14,843,277 29,686,554

Collatz Trajectory (131 steps to reach 1)

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

29,686,554 14,843,277 44,529,832 22,264,916 11,132,458 5,566,229 16,698,688 8,349,344 4,174,672 2,087,336 1,043,668 521,834 260,917 782,752 391,376 195,688 97,844 48,922 24,461 73,384 36,692 18,346 9,173 27,520 13,760 6,880 3,440 1,720 860 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 263 790 395 1,186 593 1,780 890

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #29,686,553 Browse Full Index Next Integer #29,686,555 →