9,161,850

2 × 3 × 5² × 103 × 593

9,161,850 factors as 2 × 3 × 5^2 × 103 × 593. Its 48 positive divisors give a proper-divisor sum of 13,818,822, so this integer is abundant. The Collatz stopping time is 225 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^2 × 103 × 593

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 22,980,672

Proper Divisor Sum 13,818,822

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9161839 ← → #9161869

Radix Representation

Decimal	9161850
Binary	100010111100110001111010 (24 bits)
Octal	0o42746172
Hexadecimal	0x8BCC7A

Divisor Catalog (48)

1 2 3 5 6 10 15 25 30 50 75 103 150 206 309 515 593 618 1,030 1,186 1,545 1,779 2,575 2,965 3,090 3,558 5,150 5,930 7,725 8,895 14,825 15,450 17,790 29,650 44,475 61,079 88,950 122,158 183,237 305,395 366,474 610,790 916,185 1,526,975 1,832,370 3,053,950 4,580,925 9,161,850

Collatz Trajectory (225 steps to reach 1)

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

9,161,850 4,580,925 13,742,776 6,871,388 3,435,694 1,717,847 5,153,542 2,576,771 7,730,314 3,865,157 11,595,472 5,797,736 2,898,868 1,449,434 724,717 2,174,152 1,087,076 543,538 271,769 815,308 407,654 203,827 611,482 305,741 917,224 458,612 229,306 114,653 343,960 171,980 85,990 42,995 128,986 64,493 193,480 96,740 48,370 24,185 72,556 36,278 18,139 54,418 27,209 81,628 40,814 20,407 61,222 30,611 91,834 45,917 137,752 68,876 34,438 17,219 51,658 25,829 77,488 38,744 19,372 9,686

← Previous Integer #9,161,849 Browse Full Index Next Integer #9,161,851 →