1,071,308

2² × 7 × 38261

1,071,308 factors as 2^2 × 7 × 38261. Its 12 positive divisors give a proper-divisor sum of 1,071,364, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 38261

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,142,672

Proper Divisor Sum 1,071,364

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #1071283 ← → #1071311

Radix Representation

Decimal	1071308
Binary	100000101100011001100 (21 bits)
Octal	0o4054314
Hexadecimal	0x1058CC

Divisor Catalog (12)

1 2 4 7 14 28 38,261 76,522 153,044 267,827 535,654 1,071,308

Collatz Trajectory (121 steps to reach 1)

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

1,071,308 535,654 267,827 803,482 401,741 1,205,224 602,612 301,306 150,653 451,960 225,980 112,990 56,495 169,486 84,743 254,230 127,115 381,346 190,673 572,020 286,010 143,005 429,016 214,508 107,254 53,627 160,882 80,441 241,324 120,662 60,331 180,994 90,497 271,492 135,746 67,873 203,620 101,810 50,905 152,716 76,358 38,179 114,538 57,269 171,808 85,904 42,952 21,476 10,738 5,369 16,108 8,054 4,027 12,082 6,041 18,124 9,062 4,531 13,594 6,797

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,071,307 Browse Full Index Next Integer #1,071,309 →