3,915,436

2² × 7 × 139837

3,915,436 factors as 2^2 × 7 × 139837. Its 12 positive divisors give a proper-divisor sum of 3,915,492, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 139837

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,830,928

Proper Divisor Sum 3,915,492

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3915433 ← → #3915469

Radix Representation

Decimal	3915436
Binary	1110111011111010101100 (22 bits)
Octal	0o16737254
Hexadecimal	0x3BBEAC

Divisor Catalog (12)

1 2 4 7 14 28 139,837 279,674 559,348 978,859 1,957,718 3,915,436

Collatz Trajectory (172 steps to reach 1)

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

3,915,436 1,957,718 978,859 2,936,578 1,468,289 4,404,868 2,202,434 1,101,217 3,303,652 1,651,826 825,913 2,477,740 1,238,870 619,435 1,858,306 929,153 2,787,460 1,393,730 696,865 2,090,596 1,045,298 522,649 1,567,948 783,974 391,987 1,175,962 587,981 1,763,944 881,972 440,986 220,493 661,480 330,740 165,370 82,685 248,056 124,028 62,014 31,007 93,022 46,511 139,534 69,767 209,302 104,651 313,954 156,977 470,932 235,466 117,733 353,200 176,600 88,300 44,150 22,075 66,226 33,113 99,340 49,670 24,835

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,915,435 Browse Full Index Next Integer #3,915,437 →