25,746

2 × 3 × 7 × 613

25,746 factors as 2 × 3 × 7 × 613. Its 16 positive divisors give a proper-divisor sum of 33,198, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 613

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 58,944

Proper Divisor Sum 33,198

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #25741 ← → #25747

Radix Representation

Decimal	25746
Binary	110010010010010 (15 bits)
Octal	0o62222
Hexadecimal	0x6492

Divisor Catalog (16)

1 2 3 6 7 14 21 42 613 1,226 1,839 3,678 4,291 8,582 12,873 25,746

Collatz Trajectory (108 steps to reach 1)

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

25,746 12,873 38,620 19,310 9,655 28,966 14,483 43,450 21,725 65,176 32,588 16,294 8,147 24,442 12,221 36,664 18,332 9,166 4,583 13,750 6,875 20,626 10,313 30,940 15,470 7,735 23,206 11,603 34,810 17,405 52,216 26,108 13,054 6,527 19,582 9,791 29,374 14,687 44,062 22,031 66,094 33,047 99,142 49,571 148,714 74,357 223,072 111,536 55,768 27,884 13,942 6,971 20,914 10,457 31,372 15,686 7,843 23,530 11,765 35,296

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #25,745 Browse Full Index Next Integer #25,747 →