3,397,665

3 × 5 × 226511

3,397,665 factors as 3 × 5 × 226511. Its 8 positive divisors give a proper-divisor sum of 2,038,623, so this integer is deficient. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 3 × 5 × 226511

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,436,288

Proper Divisor Sum 2,038,623

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3397663 ← → #3397679

Radix Representation

Decimal	3397665
Binary	1100111101100000100001 (22 bits)
Octal	0o14754041
Hexadecimal	0x33D821

Divisor Catalog (8)

1 3 5 15 226,511 679,533 1,132,555 3,397,665

Collatz Trajectory (84 steps to reach 1)

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

3,397,665 10,192,996 5,096,498 2,548,249 7,644,748 3,822,374 1,911,187 5,733,562 2,866,781 8,600,344 4,300,172 2,150,086 1,075,043 3,225,130 1,612,565 4,837,696 2,418,848 1,209,424 604,712 302,356 151,178 75,589 226,768 113,384 56,692 28,346 14,173 42,520 21,260 10,630 5,315 15,946 7,973 23,920 11,960 5,980 2,990 1,495 4,486 2,243 6,730 3,365 10,096 5,048 2,524 1,262 631 1,894 947 2,842 1,421 4,264 2,132 1,066 533 1,600 800 400 200 100

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,397,664 Browse Full Index Next Integer #3,397,666 →