465,330

2 × 3 × 5 × 15511

465,330 factors as 2 × 3 × 5 × 15511. Its 16 positive divisors give a proper-divisor sum of 651,534, so this integer is abundant. The Collatz stopping time is 169 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 15511

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,116,864

Proper Divisor Sum 651,534

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #465319 ← → #465331

Radix Representation

Decimal	465330
Binary	1110001100110110010 (19 bits)
Octal	0o1614662
Hexadecimal	0x719B2

Divisor Catalog (16)

1 2 3 5 6 10 15 30 15,511 31,022 46,533 77,555 93,066 155,110 232,665 465,330

Collatz Trajectory (169 steps to reach 1)

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

465,330 232,665 697,996 348,998 174,499 523,498 261,749 785,248 392,624 196,312 98,156 49,078 24,539 73,618 36,809 110,428 55,214 27,607 82,822 41,411 124,234 62,117 186,352 93,176 46,588 23,294 11,647 34,942 17,471 52,414 26,207 78,622 39,311 117,934 58,967 176,902 88,451 265,354 132,677 398,032 199,016 99,508 49,754 24,877 74,632 37,316 18,658 9,329 27,988 13,994 6,997 20,992 10,496 5,248 2,624 1,312 656 328 164 82

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #465,329 Browse Full Index Next Integer #465,331 →