126,906

2 × 3 × 13 × 1627

126,906 factors as 2 × 3 × 13 × 1627. Its 16 positive divisors give a proper-divisor sum of 146,598, so this integer is abundant. The Collatz stopping time is 79 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 1627

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 273,504

Proper Divisor Sum 146,598

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #126859 ← → #126913

Radix Representation

Decimal	126906
Binary	11110111110111010 (17 bits)
Octal	0o367672
Hexadecimal	0x1EFBA

Divisor Catalog (16)

1 2 3 6 13 26 39 78 1,627 3,254 4,881 9,762 21,151 42,302 63,453 126,906

Collatz Trajectory (79 steps to reach 1)

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

126,906 63,453 190,360 95,180 47,590 23,795 71,386 35,693 107,080 53,540 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 7,640 3,820 1,910 955 2,866 1,433 4,300 2,150 1,075 3,226 1,613 4,840

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #126,905 Browse Full Index Next Integer #126,907 →