2,406,048

2⁵ × 3 × 71 × 353

2,406,048 factors as 2^5 × 3 × 71 × 353. Its 48 positive divisors give a proper-divisor sum of 4,016,928, so this integer is abundant. The Collatz stopping time is 91 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 71 × 353

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 6,422,976

Proper Divisor Sum 4,016,928

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2406029 ← → #2406067

Radix Representation

Decimal	2406048
Binary	1001001011011010100000 (22 bits)
Octal	0o11133240
Hexadecimal	0x24B6A0

Divisor Catalog (48)

1 2 3 4 6 8 12 16 24 32 48 71 96 142 213 284 353 426 568 706 852 1,059 1,136 1,412 1,704 2,118 2,272 2,824 3,408 4,236 5,648 6,816 8,472 11,296 16,944 25,063 33,888 50,126 75,189 100,252 150,378 200,504 300,756 401,008 601,512 802,016 1,203,024 2,406,048

Collatz Trajectory (91 steps to reach 1)

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

2,406,048 1,203,024 601,512 300,756 150,378 75,189 225,568 112,784 56,392 28,196 14,098 7,049 21,148 10,574 5,287 15,862 7,931 23,794 11,897 35,692 17,846 8,923 26,770 13,385 40,156 20,078 10,039 30,118 15,059 45,178 22,589 67,768 33,884 16,942 8,471 25,414 12,707 38,122 19,061 57,184 28,592 14,296 7,148 3,574 1,787 5,362 2,681 8,044 4,022 2,011 6,034 3,017 9,052 4,526 2,263 6,790 3,395 10,186 5,093 15,280

← Previous Integer #2,406,047 Browse Full Index Next Integer #2,406,049 →