2,723,946

2 × 3 × 453991

2,723,946 factors as 2 × 3 × 453991. Its 8 positive divisors give a proper-divisor sum of 2,723,958, so this integer is abundant. The Collatz stopping time is 107 steps.

Prime Factor Structure

Factorization String 2 × 3 × 453991

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,447,904

Proper Divisor Sum 2,723,958

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2723933 ← → #2723947

Radix Representation

Decimal	2723946
Binary	1010011001000001101010 (22 bits)
Octal	0o12310152
Hexadecimal	0x29906A

Divisor Catalog (8)

1 2 3 6 453,991 907,982 1,361,973 2,723,946

Collatz Trajectory (107 steps to reach 1)

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

2,723,946 1,361,973 4,085,920 2,042,960 1,021,480 510,740 255,370 127,685 383,056 191,528 95,764 47,882 23,941 71,824 35,912 17,956 8,978 4,489 13,468 6,734 3,367 10,102 5,051 15,154 7,577 22,732 11,366 5,683 17,050 8,525 25,576 12,788 6,394 3,197 9,592 4,796 2,398 1,199 3,598 1,799 5,398 2,699 8,098 4,049 12,148 6,074 3,037 9,112 4,556 2,278 1,139 3,418 1,709 5,128 2,564 1,282 641 1,924 962 481

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #2,723,945 Browse Full Index Next Integer #2,723,947 →