9,764,862

2 × 3 × 1093 × 1489

9,764,862 factors as 2 × 3 × 1093 × 1489. Its 16 positive divisors give a proper-divisor sum of 9,795,858, so this integer is abundant. The Collatz stopping time is 220 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1093 × 1489

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 19,560,720

Proper Divisor Sum 9,795,858

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9764849 ← → #9764863

Radix Representation

Decimal	9764862
Binary	100101001111111111111110 (24 bits)
Octal	0o45177776
Hexadecimal	0x94FFFE

Divisor Catalog (16)

1 2 3 6 1,093 1,489 2,186 2,978 3,279 4,467 6,558 8,934 1,627,477 3,254,954 4,882,431 9,764,862

Collatz Trajectory (220 steps to reach 1)

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

9,764,862 4,882,431 14,647,294 7,323,647 21,970,942 10,985,471 32,956,414 16,478,207 49,434,622 24,717,311 74,151,934 37,075,967 111,227,902 55,613,951 166,841,854 83,420,927 250,262,782 125,131,391 375,394,174 187,697,087 563,091,262 281,545,631 844,636,894 422,318,447 1,266,955,342 633,477,671 1,900,433,014 950,216,507 2,850,649,522 1,425,324,761 4,275,974,284 2,137,987,142 1,068,993,571 3,206,980,714 1,603,490,357 4,810,471,072 2,405,235,536 1,202,617,768 601,308,884 300,654,442 150,327,221 450,981,664 225,490,832 112,745,416 56,372,708 28,186,354 14,093,177 42,279,532 21,139,766 10,569,883 31,709,650 15,854,825 47,564,476 23,782,238 11,891,119 35,673,358 17,836,679 53,510,038 26,755,019 80,265,058

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,764,861 Browse Full Index Next Integer #9,764,863 →