3,909,256

2³ × 13 × 37589

3,909,256 factors as 2^3 × 13 × 37589. Its 16 positive divisors give a proper-divisor sum of 3,984,644, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 37589

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,893,900

Proper Divisor Sum 3,984,644

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #3909253 ← → #3909263

Radix Representation

Decimal	3909256
Binary	1110111010011010001000 (22 bits)
Octal	0o16723210
Hexadecimal	0x3BA688

Divisor Catalog (16)

1 2 4 8 13 26 52 104 37,589 75,178 150,356 300,712 488,657 977,314 1,954,628 3,909,256

Collatz Trajectory (154 steps to reach 1)

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

3,909,256 1,954,628 977,314 488,657 1,465,972 732,986 366,493 1,099,480 549,740 274,870 137,435 412,306 206,153 618,460 309,230 154,615 463,846 231,923 695,770 347,885 1,043,656 521,828 260,914 130,457 391,372 195,686 97,843 293,530 146,765 440,296 220,148 110,074 55,037 165,112 82,556 41,278 20,639 61,918 30,959 92,878 46,439 139,318 69,659 208,978 104,489 313,468 156,734 78,367 235,102 117,551 352,654 176,327 528,982 264,491 793,474 396,737 1,190,212 595,106 297,553 892,660

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,909,255 Browse Full Index Next Integer #3,909,257 →