635,136

2⁸ × 3 × 827

635,136 factors as 2^8 × 3 × 827. Its 36 positive divisors give a proper-divisor sum of 1,057,296, so this integer is abundant. The Collatz stopping time is 48 steps.

Prime Factor Structure

Factorization String 2^8 × 3 × 827

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 1,692,432

Proper Divisor Sum 1,057,296

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #635119 ← → #635147

Radix Representation

Decimal	635136
Binary	10011011000100000000 (20 bits)
Octal	0o2330400
Hexadecimal	0x9B100

Divisor Catalog (36)

1 2 3 4 6 8 12 16 24 32 48 64 96 128 192 256 384 768 827 1,654 2,481 3,308 4,962 6,616 9,924 13,232 19,848 26,464 39,696 52,928 79,392 105,856 158,784 211,712 317,568 635,136

Collatz Trajectory (48 steps to reach 1)

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

635,136 317,568 158,784 79,392 39,696 19,848 9,924 4,962 2,481 7,444 3,722 1,861 5,584 2,792 1,396 698 349 1,048 524 262 131 394 197 592 296 148 74 37 112 56 28 14 7 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 #635,135 Browse Full Index Next Integer #635,137 →