9,215,952

2⁴ × 3 × 191999

9,215,952 factors as 2^4 × 3 × 191999. Its 20 positive divisors give a proper-divisor sum of 14,592,048, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 191999

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 23,808,000

Proper Divisor Sum 14,592,048

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9215951 ← → #9215953

Radix Representation

Decimal	9215952
Binary	100011001001111111010000 (24 bits)
Octal	0o43117720
Hexadecimal	0x8C9FD0

Divisor Catalog (20)

1 2 3 4 6 8 12 16 24 48 191,999 383,998 575,997 767,996 1,151,994 1,535,992 2,303,988 3,071,984 4,607,976 9,215,952

Collatz Trajectory (106 steps to reach 1)

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

9,215,952 4,607,976 2,303,988 1,151,994 575,997 1,727,992 863,996 431,998 215,999 647,998 323,999 971,998 485,999 1,457,998 728,999 2,186,998 1,093,499 3,280,498 1,640,249 4,920,748 2,460,374 1,230,187 3,690,562 1,845,281 5,535,844 2,767,922 1,383,961 4,151,884 2,075,942 1,037,971 3,113,914 1,556,957 4,670,872 2,335,436 1,167,718 583,859 1,751,578 875,789 2,627,368 1,313,684 656,842 328,421 985,264 492,632 246,316 123,158 61,579 184,738 92,369 277,108 138,554 69,277 207,832 103,916 51,958 25,979 77,938 38,969 116,908 58,454

← Previous Integer #9,215,951 Browse Full Index Next Integer #9,215,953 →