1,161,606

2 × 3 × 193601

1,161,606 factors as 2 × 3 × 193601. Its 8 positive divisors give a proper-divisor sum of 1,161,618, so this integer is abundant. The Collatz stopping time is 85 steps.

Prime Factor Structure

Factorization String 2 × 3 × 193601

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 2,323,224

Proper Divisor Sum 1,161,618

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1161599 ← → #1161617

Radix Representation

Decimal	1161606
Binary	100011011100110000110 (21 bits)
Octal	0o4334606
Hexadecimal	0x11B986

Divisor Catalog (8)

1 2 3 6 193,601 387,202 580,803 1,161,606

Collatz Trajectory (85 steps to reach 1)

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

1,161,606 580,803 1,742,410 871,205 2,613,616 1,306,808 653,404 326,702 163,351 490,054 245,027 735,082 367,541 1,102,624 551,312 275,656 137,828 68,914 34,457 103,372 51,686 25,843 77,530 38,765 116,296 58,148 29,074 14,537 43,612 21,806 10,903 32,710 16,355 49,066 24,533 73,600 36,800 18,400 9,200 4,600 2,300 1,150 575 1,726 863 2,590 1,295 3,886 1,943 5,830 2,915 8,746 4,373 13,120 6,560 3,280 1,640 820 410 205

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,161,605 Browse Full Index Next Integer #1,161,607 →