10,696,746

2 × 3 × 1782791

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

Prime Factor Structure

Factorization String 2 × 3 × 1782791

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 21,393,504

Proper Divisor Sum 10,696,758

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #10696739 ← → #10696747

Radix Representation

Decimal	10696746
Binary	101000110011100000101010 (24 bits)
Octal	0o50634052
Hexadecimal	0xA3382A

Divisor Catalog (8)

1 2 3 6 1,782,791 3,565,582 5,348,373 10,696,746

Collatz Trajectory (96 steps to reach 1)

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

10,696,746 5,348,373 16,045,120 8,022,560 4,011,280 2,005,640 1,002,820 501,410 250,705 752,116 376,058 188,029 564,088 282,044 141,022 70,511 211,534 105,767 317,302 158,651 475,954 237,977 713,932 356,966 178,483 535,450 267,725 803,176 401,588 200,794 100,397 301,192 150,596 75,298 37,649 112,948 56,474 28,237 84,712 42,356 21,178 10,589 31,768 15,884 7,942 3,971 11,914 5,957 17,872 8,936 4,468 2,234 1,117 3,352 1,676 838 419 1,258 629 1,888

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #10,696,745 Browse Full Index Next Integer #10,696,747 →