2,302,746

2 × 3 × 383791

2,302,746 factors as 2 × 3 × 383791. Its 8 positive divisors give a proper-divisor sum of 2,302,758, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2 × 3 × 383791

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,605,504

Proper Divisor Sum 2,302,758

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2302717 ← → #2302753

Radix Representation

Decimal	2302746
Binary	1000110010001100011010 (22 bits)
Octal	0o10621432
Hexadecimal	0x23231A

Divisor Catalog (8)

1 2 3 6 383,791 767,582 1,151,373 2,302,746

Collatz Trajectory (86 steps to reach 1)

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

2,302,746 1,151,373 3,454,120 1,727,060 863,530 431,765 1,295,296 647,648 323,824 161,912 80,956 40,478 20,239 60,718 30,359 91,078 45,539 136,618 68,309 204,928 102,464 51,232 25,616 12,808 6,404 3,202 1,601 4,804 2,402 1,201 3,604 1,802 901 2,704 1,352 676 338 169 508 254 127 382 191 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280 1,640 820 410

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,302,745 Browse Full Index Next Integer #2,302,747 →