3,990,702

2 × 3 × 665117

3,990,702 factors as 2 × 3 × 665117. Its 8 positive divisors give a proper-divisor sum of 3,990,714, so this integer is abundant. The Collatz stopping time is 141 steps.

Prime Factor Structure

Factorization String 2 × 3 × 665117

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,981,416

Proper Divisor Sum 3,990,714

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3990689 ← → #3990731

Radix Representation

Decimal	3990702
Binary	1111001110010010101110 (22 bits)
Octal	0o17162256
Hexadecimal	0x3CE4AE

Divisor Catalog (8)

1 2 3 6 665,117 1,330,234 1,995,351 3,990,702

Collatz Trajectory (141 steps to reach 1)

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

3,990,702 1,995,351 5,986,054 2,993,027 8,979,082 4,489,541 13,468,624 6,734,312 3,367,156 1,683,578 841,789 2,525,368 1,262,684 631,342 315,671 947,014 473,507 1,420,522 710,261 2,130,784 1,065,392 532,696 266,348 133,174 66,587 199,762 99,881 299,644 149,822 74,911 224,734 112,367 337,102 168,551 505,654 252,827 758,482 379,241 1,137,724 568,862 284,431 853,294 426,647 1,279,942 639,971 1,919,914 959,957 2,879,872 1,439,936 719,968 359,984 179,992 89,996 44,998 22,499 67,498 33,749 101,248 50,624 25,312

← Previous Integer #3,990,701 Browse Full Index Next Integer #3,990,703 →