3,853,950

2 × 3 × 5² × 25693

3,853,950 factors as 2 × 3 × 5^2 × 25693. Its 24 positive divisors give a proper-divisor sum of 5,704,218, so this integer is abundant. The Collatz stopping time is 216 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^2 × 25693

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 9,558,168

Proper Divisor Sum 5,704,218

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3853943 ← → #3853991

Radix Representation

Decimal	3853950
Binary	1110101100111001111110 (22 bits)
Octal	0o16547176
Hexadecimal	0x3ACE7E

Divisor Catalog (24)

Collatz Trajectory (216 steps to reach 1)

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

3,853,950 1,926,975 5,780,926 2,890,463 8,671,390 4,335,695 13,007,086 6,503,543 19,510,630 9,755,315 29,265,946 14,632,973 43,898,920 21,949,460 10,974,730 5,487,365 16,462,096 8,231,048 4,115,524 2,057,762 1,028,881 3,086,644 1,543,322 771,661 2,314,984 1,157,492 578,746 289,373 868,120 434,060 217,030 108,515 325,546 162,773 488,320 244,160 122,080 61,040 30,520 15,260 7,630 3,815 11,446 5,723 17,170 8,585 25,756 12,878 6,439 19,318 9,659 28,978 14,489 43,468 21,734 10,867 32,602 16,301 48,904 24,452

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,853,949 Browse Full Index Next Integer #3,853,951 →