3,445,708

2² × 7 × 109 × 1129

3,445,708 factors as 2^2 × 7 × 109 × 1129. Its 24 positive divisors give a proper-divisor sum of 3,515,092, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 109 × 1129

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 6,960,800

Proper Divisor Sum 3,515,092

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3445703 ← → #3445723

Radix Representation

Decimal	3445708
Binary	1101001001001111001100 (22 bits)
Octal	0o15111714
Hexadecimal	0x3493CC

Divisor Catalog (24)

Collatz Trajectory (97 steps to reach 1)

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

3,445,708 1,722,854 861,427 2,584,282 1,292,141 3,876,424 1,938,212 969,106 484,553 1,453,660 726,830 363,415 1,090,246 545,123 1,635,370 817,685 2,453,056 1,226,528 613,264 306,632 153,316 76,658 38,329 114,988 57,494 28,747 86,242 43,121 129,364 64,682 32,341 97,024 48,512 24,256 12,128 6,064 3,032 1,516 758 379 1,138 569 1,708 854 427 1,282 641 1,924 962 481 1,444 722 361 1,084 542 271 814 407 1,222 611

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,445,707 Browse Full Index Next Integer #3,445,709 →