3,270,459

3 × 1090153

3,270,459 factors as 3 × 1090153. Its 4 positive divisors give a proper-divisor sum of 1,090,157, so this integer is deficient. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 3 × 1090153

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 4,360,616

Proper Divisor Sum 1,090,157

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3270457 ← → #3270461

Radix Representation

Decimal	3270459
Binary	1100011110011100111011 (22 bits)
Octal	0o14363473
Hexadecimal	0x31E73B

Divisor Catalog (4)

1 3 1,090,153 3,270,459

Collatz Trajectory (164 steps to reach 1)

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

3,270,459 9,811,378 4,905,689 14,717,068 7,358,534 3,679,267 11,037,802 5,518,901 16,556,704 8,278,352 4,139,176 2,069,588 1,034,794 517,397 1,552,192 776,096 388,048 194,024 97,012 48,506 24,253 72,760 36,380 18,190 9,095 27,286 13,643 40,930 20,465 61,396 30,698 15,349 46,048 23,024 11,512 5,756 2,878 1,439 4,318 2,159 6,478 3,239 9,718 4,859 14,578 7,289 21,868 10,934 5,467 16,402 8,201 24,604 12,302 6,151 18,454 9,227 27,682 13,841 41,524 20,762

← Previous Integer #3,270,458 Browse Full Index Next Integer #3,270,460 →