1,369,932

2² × 3 × 114161

1,369,932 factors as 2^2 × 3 × 114161. Its 12 positive divisors give a proper-divisor sum of 1,826,604, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 114161

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,196,536

Proper Divisor Sum 1,826,604

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1369897 ← → #1369943

Radix Representation

Decimal	1369932
Binary	101001110011101001100 (21 bits)
Octal	0o5163514
Hexadecimal	0x14E74C

Divisor Catalog (12)

1 2 3 4 6 12 114,161 228,322 342,483 456,644 684,966 1,369,932

Collatz Trajectory (106 steps to reach 1)

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

1,369,932 684,966 342,483 1,027,450 513,725 1,541,176 770,588 385,294 192,647 577,942 288,971 866,914 433,457 1,300,372 650,186 325,093 975,280 487,640 243,820 121,910 60,955 182,866 91,433 274,300 137,150 68,575 205,726 102,863 308,590 154,295 462,886 231,443 694,330 347,165 1,041,496 520,748 260,374 130,187 390,562 195,281 585,844 292,922 146,461 439,384 219,692 109,846 54,923 164,770 82,385 247,156 123,578 61,789 185,368 92,684 46,342 23,171 69,514 34,757 104,272 52,136

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,369,931 Browse Full Index Next Integer #1,369,933 →