3,694,432

2⁵ × 7 × 16493

3,694,432 factors as 2^5 × 7 × 16493. Its 24 positive divisors give a proper-divisor sum of 4,618,544, so this integer is abundant. The Collatz stopping time is 159 steps.

Prime Factor Structure

Factorization String 2^5 × 7 × 16493

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 8,312,976

Proper Divisor Sum 4,618,544

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3694429 ← → #3694433

Radix Representation

Decimal	3694432
Binary	1110000101111101100000 (22 bits)
Octal	0o16057540
Hexadecimal	0x385F60

Divisor Catalog (24)

Collatz Trajectory (159 steps to reach 1)

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

3,694,432 1,847,216 923,608 461,804 230,902 115,451 346,354 173,177 519,532 259,766 129,883 389,650 194,825 584,476 292,238 146,119 438,358 219,179 657,538 328,769 986,308 493,154 246,577 739,732 369,866 184,933 554,800 277,400 138,700 69,350 34,675 104,026 52,013 156,040 78,020 39,010 19,505 58,516 29,258 14,629 43,888 21,944 10,972 5,486 2,743 8,230 4,115 12,346 6,173 18,520 9,260 4,630 2,315 6,946 3,473 10,420 5,210 2,605 7,816 3,908

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,694,431 Browse Full Index Next Integer #3,694,433 →