8,804,634

2 × 3 × 1467439

8,804,634 factors as 2 × 3 × 1467439. Its 8 positive divisors give a proper-divisor sum of 8,804,646, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1467439

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 17,609,280

Proper Divisor Sum 8,804,646

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #8804633 ← → #8804647

Radix Representation

Decimal	8804634
Binary	100001100101100100011010 (24 bits)
Octal	0o41454432
Hexadecimal	0x86591A

Divisor Catalog (8)

1 2 3 6 1,467,439 2,934,878 4,402,317 8,804,634

Collatz Trajectory (88 steps to reach 1)

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

8,804,634 4,402,317 13,206,952 6,603,476 3,301,738 1,650,869 4,952,608 2,476,304 1,238,152 619,076 309,538 154,769 464,308 232,154 116,077 348,232 174,116 87,058 43,529 130,588 65,294 32,647 97,942 48,971 146,914 73,457 220,372 110,186 55,093 165,280 82,640 41,320 20,660 10,330 5,165 15,496 7,748 3,874 1,937 5,812 2,906 1,453 4,360 2,180 1,090 545 1,636 818 409 1,228 614 307 922 461 1,384 692 346 173 520 260

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,804,633 Browse Full Index Next Integer #8,804,635 →