909,066

2 × 3 × 127 × 1193

909,066 factors as 2 × 3 × 127 × 1193. Its 16 positive divisors give a proper-divisor sum of 924,918, so this integer is abundant. The Collatz stopping time is 201 steps.

Prime Factor Structure

Factorization String 2 × 3 × 127 × 1193

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,833,984

Proper Divisor Sum 924,918

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #909061 ← → #909071

Radix Representation

Decimal	909066
Binary	11011101111100001010 (20 bits)
Octal	0o3357412
Hexadecimal	0xDDF0A

Divisor Catalog (16)

1 2 3 6 127 254 381 762 1,193 2,386 3,579 7,158 151,511 303,022 454,533 909,066

Collatz Trajectory (201 steps to reach 1)

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

909,066 454,533 1,363,600 681,800 340,900 170,450 85,225 255,676 127,838 63,919 191,758 95,879 287,638 143,819 431,458 215,729 647,188 323,594 161,797 485,392 242,696 121,348 60,674 30,337 91,012 45,506 22,753 68,260 34,130 17,065 51,196 25,598 12,799 38,398 19,199 57,598 28,799 86,398 43,199 129,598 64,799 194,398 97,199 291,598 145,799 437,398 218,699 656,098 328,049 984,148 492,074 246,037 738,112 369,056 184,528 92,264 46,132 23,066 11,533 34,600

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #909,065 Browse Full Index Next Integer #909,067 →