430,592

2⁹ × 29²

430,592 factors as 2^9 × 29^2. Its 30 positive divisors give a proper-divisor sum of 460,441, so this integer is abundant. The Collatz stopping time is 50 steps.

Prime Factor Structure

Factorization String 2^9 × 29^2

Distinct Prime Factors 2

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 30

Divisor Sum (σ) 891,033

Proper Divisor Sum 460,441

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #430589 ← → #430601

Radix Representation

Decimal	430592
Binary	1101001001000000000 (19 bits)
Octal	0o1511000
Hexadecimal	0x69200

Divisor Catalog (30)

1 2 4 8 16 29 32 58 64 116 128 232 256 464 512 841 928 1,682 1,856 3,364 3,712 6,728 7,424 13,456 14,848 26,912 53,824 107,648 215,296 430,592

Collatz Trajectory (50 steps to reach 1)

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

430,592 215,296 107,648 53,824 26,912 13,456 6,728 3,364 1,682 841 2,524 1,262 631 1,894 947 2,842 1,421 4,264 2,132 1,066 533 1,600 800 400 200 100 50 25 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #430,591 Browse Full Index Next Integer #430,593 →