3,274,466

2 × 13 × 125941

3,274,466 factors as 2 × 13 × 125941. Its 8 positive divisors give a proper-divisor sum of 2,015,098, so this integer is deficient. The Collatz stopping time is 208 steps.

Prime Factor Structure

Factorization String 2 × 13 × 125941

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,289,564

Proper Divisor Sum 2,015,098

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #3274459 ← → #3274511

Radix Representation

Decimal	3274466
Binary	1100011111011011100010 (22 bits)
Octal	0o14373342
Hexadecimal	0x31F6E2

Divisor Catalog (8)

1 2 13 26 125,941 251,882 1,637,233 3,274,466

Collatz Trajectory (208 steps to reach 1)

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

3,274,466 1,637,233 4,911,700 2,455,850 1,227,925 3,683,776 1,841,888 920,944 460,472 230,236 115,118 57,559 172,678 86,339 259,018 129,509 388,528 194,264 97,132 48,566 24,283 72,850 36,425 109,276 54,638 27,319 81,958 40,979 122,938 61,469 184,408 92,204 46,102 23,051 69,154 34,577 103,732 51,866 25,933 77,800 38,900 19,450 9,725 29,176 14,588 7,294 3,647 10,942 5,471 16,414 8,207 24,622 12,311 36,934 18,467 55,402 27,701 83,104 41,552 20,776

← Previous Integer #3,274,465 Browse Full Index Next Integer #3,274,467 →