9,373,408

2⁵ × 11 × 31 × 859

9,373,408 factors as 2^5 × 11 × 31 × 859. Its 48 positive divisors give a proper-divisor sum of 11,431,712, so this integer is abundant. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 2^5 × 11 × 31 × 859

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 20,805,120

Proper Divisor Sum 11,431,712

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #9373393 ← → #9373417

Radix Representation

Decimal	9373408
Binary	100011110000011011100000 (24 bits)
Octal	0o43603340
Hexadecimal	0x8F06E0

Divisor Catalog (48)

1 2 4 8 11 16 22 31 32 44 62 88 124 176 248 341 352 496 682 859 992 1,364 1,718 2,728 3,436 5,456 6,872 9,449 10,912 13,744 18,898 26,629 27,488 37,796 53,258 75,592 106,516 151,184 213,032 292,919 302,368 426,064 585,838 852,128 1,171,676 2,343,352 4,686,704 9,373,408

Collatz Trajectory (181 steps to reach 1)

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

9,373,408 4,686,704 2,343,352 1,171,676 585,838 292,919 878,758 439,379 1,318,138 659,069 1,977,208 988,604 494,302 247,151 741,454 370,727 1,112,182 556,091 1,668,274 834,137 2,502,412 1,251,206 625,603 1,876,810 938,405 2,815,216 1,407,608 703,804 351,902 175,951 527,854 263,927 791,782 395,891 1,187,674 593,837 1,781,512 890,756 445,378 222,689 668,068 334,034 167,017 501,052 250,526 125,263 375,790 187,895 563,686 281,843 845,530 422,765 1,268,296 634,148 317,074 158,537 475,612 237,806 118,903 356,710

← Previous Integer #9,373,407 Browse Full Index Next Integer #9,373,409 →