139,752

2³ × 3³ × 647

139,752 factors as 2^3 × 3^3 × 647. Its 32 positive divisors give a proper-divisor sum of 249,048, so this integer is abundant. The Collatz stopping time is 144 steps.

Prime Factor Structure

Factorization String 2^3 × 3^3 × 647

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 388,800

Proper Divisor Sum 249,048

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #139747 ← → #139753

Radix Representation

Decimal	139752
Binary	100010000111101000 (18 bits)
Octal	0o420750
Hexadecimal	0x221E8

Divisor Catalog (32)

1 2 3 4 6 8 9 12 18 24 27 36 54 72 108 216 647 1,294 1,941 2,588 3,882 5,176 5,823 7,764 11,646 15,528 17,469 23,292 34,938 46,584 69,876 139,752

Collatz Trajectory (144 steps to reach 1)

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

139,752 69,876 34,938 17,469 52,408 26,204 13,102 6,551 19,654 9,827 29,482 14,741 44,224 22,112 11,056 5,528 2,764 1,382 691 2,074 1,037 3,112 1,556 778 389 1,168 584 292 146 73 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #139,751 Browse Full Index Next Integer #139,753 →