7,739,826

2 × 3 × 1289971

7,739,826 factors as 2 × 3 × 1289971. Its 8 positive divisors give a proper-divisor sum of 7,739,838, so this integer is abundant. The Collatz stopping time is 186 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1289971

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 15,479,664

Proper Divisor Sum 7,739,838

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #7739803 ← → #7739843

Radix Representation

Decimal	7739826
Binary	11101100001100110110010 (23 bits)
Octal	0o35414662
Hexadecimal	0x7619B2

Divisor Catalog (8)

1 2 3 6 1,289,971 2,579,942 3,869,913 7,739,826

Collatz Trajectory (186 steps to reach 1)

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

7,739,826 3,869,913 11,609,740 5,804,870 2,902,435 8,707,306 4,353,653 13,060,960 6,530,480 3,265,240 1,632,620 816,310 408,155 1,224,466 612,233 1,836,700 918,350 459,175 1,377,526 688,763 2,066,290 1,033,145 3,099,436 1,549,718 774,859 2,324,578 1,162,289 3,486,868 1,743,434 871,717 2,615,152 1,307,576 653,788 326,894 163,447 490,342 245,171 735,514 367,757 1,103,272 551,636 275,818 137,909 413,728 206,864 103,432 51,716 25,858 12,929 38,788 19,394 9,697 29,092 14,546 7,273 21,820 10,910 5,455 16,366 8,183

← Previous Integer #7,739,825 Browse Full Index Next Integer #7,739,827 →