7,006,806

2 × 3² × 29 × 31 × 433

7,006,806 factors as 2 × 3^2 × 29 × 31 × 433. Its 48 positive divisors give a proper-divisor sum of 9,242,154, so this integer is abundant. The Collatz stopping time is 266 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 29 × 31 × 433

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 16,248,960

Proper Divisor Sum 9,242,154

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #7006799 ← → #7006817

Radix Representation

Decimal	7006806
Binary	11010101110101001010110 (23 bits)
Octal	0o32565126
Hexadecimal	0x6AEA56

Divisor Catalog (48)

1 2 3 6 9 18 29 31 58 62 87 93 174 186 261 279 433 522 558 866 899 1,299 1,798 2,598 2,697 3,897 5,394 7,794 8,091 12,557 13,423 16,182 25,114 26,846 37,671 40,269 75,342 80,538 113,013 120,807 226,026 241,614 389,267 778,534 1,167,801 2,335,602 3,503,403 7,006,806

Collatz Trajectory (266 steps to reach 1)

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

7,006,806 3,503,403 10,510,210 5,255,105 15,765,316 7,882,658 3,941,329 11,823,988 5,911,994 2,955,997 8,867,992 4,433,996 2,216,998 1,108,499 3,325,498 1,662,749 4,988,248 2,494,124 1,247,062 623,531 1,870,594 935,297 2,805,892 1,402,946 701,473 2,104,420 1,052,210 526,105 1,578,316 789,158 394,579 1,183,738 591,869 1,775,608 887,804 443,902 221,951 665,854 332,927 998,782 499,391 1,498,174 749,087 2,247,262 1,123,631 3,370,894 1,685,447 5,056,342 2,528,171 7,584,514 3,792,257 11,376,772 5,688,386 2,844,193 8,532,580 4,266,290 2,133,145 6,399,436 3,199,718 1,599,859

← Previous Integer #7,006,805 Browse Full Index Next Integer #7,006,807 →