3,284,436

2² × 3 × 191 × 1433

3,284,436 factors as 2^2 × 3 × 191 × 1433. Its 24 positive divisors give a proper-divisor sum of 4,424,748, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 191 × 1433

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 7,709,184

Proper Divisor Sum 4,424,748

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3284371 ← → #3284441

Radix Representation

Decimal	3284436
Binary	1100100001110111010100 (22 bits)
Octal	0o14416724
Hexadecimal	0x321DD4

Divisor Catalog (24)

1 2 3 4 6 12 191 382 573 764 1,146 1,433 2,292 2,866 4,299 5,732 8,598 17,196 273,703 547,406 821,109 1,094,812 1,642,218 3,284,436

Collatz Trajectory (84 steps to reach 1)

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

3,284,436 1,642,218 821,109 2,463,328 1,231,664 615,832 307,916 153,958 76,979 230,938 115,469 346,408 173,204 86,602 43,301 129,904 64,952 32,476 16,238 8,119 24,358 12,179 36,538 18,269 54,808 27,404 13,702 6,851 20,554 10,277 30,832 15,416 7,708 3,854 1,927 5,782 2,891 8,674 4,337 13,012 6,506 3,253 9,760 4,880 2,440 1,220 610 305 916 458 229 688 344 172 86 43 130 65 196 98

← Previous Integer #3,284,435 Browse Full Index Next Integer #3,284,437 →