999,690

2 × 3 × 5 × 47 × 709

999,690 factors as 2 × 3 × 5 × 47 × 709. Its 32 positive divisors give a proper-divisor sum of 1,454,070, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 47 × 709

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 2,453,760

Proper Divisor Sum 1,454,070

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #999683 ← → #999721

Radix Representation

Decimal	999690
Binary	11110100000100001010 (20 bits)
Octal	0o3640412
Hexadecimal	0xF410A

Divisor Catalog (32)

Collatz Trajectory (139 steps to reach 1)

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

999,690 499,845 1,499,536 749,768 374,884 187,442 93,721 281,164 140,582 70,291 210,874 105,437 316,312 158,156 79,078 39,539 118,618 59,309 177,928 88,964 44,482 22,241 66,724 33,362 16,681 50,044 25,022 12,511 37,534 18,767 56,302 28,151 84,454 42,227 126,682 63,341 190,024 95,012 47,506 23,753 71,260 35,630 17,815 53,446 26,723 80,170 40,085 120,256 60,128 30,064 15,032 7,516 3,758 1,879 5,638 2,819 8,458 4,229 12,688 6,344

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #999,689 Browse Full Index Next Integer #999,691 →