3,200,271

3 × 1066757

3,200,271 factors as 3 × 1066757. Its 4 positive divisors give a proper-divisor sum of 1,066,761, so this integer is deficient. The Collatz stopping time is 58 steps.

Prime Factor Structure

Factorization String 3 × 1066757

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 4,267,032

Proper Divisor Sum 1,066,761

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #3200257 ← → #3200279

Radix Representation

Decimal	3200271
Binary	1100001101010100001111 (22 bits)
Octal	0o14152417
Hexadecimal	0x30D50F

Divisor Catalog (4)

1 3 1,066,757 3,200,271

Collatz Trajectory (58 steps to reach 1)

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

3,200,271 9,600,814 4,800,407 14,401,222 7,200,611 21,601,834 10,800,917 32,402,752 16,201,376 8,100,688 4,050,344 2,025,172 1,012,586 506,293 1,518,880 759,440 379,720 189,860 94,930 47,465 142,396 71,198 35,599 106,798 53,399 160,198 80,099 240,298 120,149 360,448 180,224 90,112 45,056 22,528 11,264 5,632 2,816 1,408 704 352 176 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,200,270 Browse Full Index Next Integer #3,200,272 →