2,425,938

2 × 3 × 404323

2,425,938 factors as 2 × 3 × 404323. Its 8 positive divisors give a proper-divisor sum of 2,425,950, so this integer is abundant. The Collatz stopping time is 117 steps.

Prime Factor Structure

Factorization String 2 × 3 × 404323

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 4,851,888

Proper Divisor Sum 2,425,950

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #2425933 ← → #2425957

Radix Representation

Decimal	2425938
Binary	1001010000010001010010 (22 bits)
Octal	0o11202122
Hexadecimal	0x250452

Divisor Catalog (8)

1 2 3 6 404,323 808,646 1,212,969 2,425,938

Collatz Trajectory (117 steps to reach 1)

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

2,425,938 1,212,969 3,638,908 1,819,454 909,727 2,729,182 1,364,591 4,093,774 2,046,887 6,140,662 3,070,331 9,210,994 4,605,497 13,816,492 6,908,246 3,454,123 10,362,370 5,181,185 15,543,556 7,771,778 3,885,889 11,657,668 5,828,834 2,914,417 8,743,252 4,371,626 2,185,813 6,557,440 3,278,720 1,639,360 819,680 409,840 204,920 102,460 51,230 25,615 76,846 38,423 115,270 57,635 172,906 86,453 259,360 129,680 64,840 32,420 16,210 8,105 24,316 12,158 6,079 18,238 9,119 27,358 13,679 41,038 20,519 61,558 30,779 92,338

← Previous Integer #2,425,937 Browse Full Index Next Integer #2,425,939 →