70,260

2² × 3 × 5 × 1171

70,260 factors as 2^2 × 3 × 5 × 1171. Its 24 positive divisors give a proper-divisor sum of 126,636, so this integer is abundant. The Collatz stopping time is 174 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 1171

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 196,896

Proper Divisor Sum 126,636

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #70249 ← → #70271

Radix Representation

Decimal	70260
Binary	10001001001110100 (17 bits)
Octal	0o211164
Hexadecimal	0x11274

Divisor Catalog (24)

1 2 3 4 5 6 10 12 15 20 30 60 1,171 2,342 3,513 4,684 5,855 7,026 11,710 14,052 17,565 23,420 35,130 70,260

Collatz Trajectory (174 steps to reach 1)

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

70,260 35,130 17,565 52,696 26,348 13,174 6,587 19,762 9,881 29,644 14,822 7,411 22,234 11,117 33,352 16,676 8,338 4,169 12,508 6,254 3,127 9,382 4,691 14,074 7,037 21,112 10,556 5,278 2,639 7,918 3,959 11,878 5,939 17,818 8,909 26,728 13,364 6,682 3,341 10,024 5,012 2,506 1,253 3,760 1,880 940 470 235 706 353 1,060 530 265 796 398 199 598 299 898 449

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #70,259 Browse Full Index Next Integer #70,261 →