835,458

2 × 3 × 13 × 10711

835,458 factors as 2 × 3 × 13 × 10711. Its 16 positive divisors give a proper-divisor sum of 964,158, so this integer is abundant. The Collatz stopping time is 82 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 10711

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,799,616

Proper Divisor Sum 964,158

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #835453 ← → #835459

Radix Representation

Decimal	835458
Binary	11001011111110000010 (20 bits)
Octal	0o3137602
Hexadecimal	0xCBF82

Divisor Catalog (16)

1 2 3 6 13 26 39 78 10,711 21,422 32,133 64,266 139,243 278,486 417,729 835,458

Collatz Trajectory (82 steps to reach 1)

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

835,458 417,729 1,253,188 626,594 313,297 939,892 469,946 234,973 704,920 352,460 176,230 88,115 264,346 132,173 396,520 198,260 99,130 49,565 148,696 74,348 37,174 18,587 55,762 27,881 83,644 41,822 20,911 62,734 31,367 94,102 47,051 141,154 70,577 211,732 105,866 52,933 158,800 79,400 39,700 19,850 9,925 29,776 14,888 7,444 3,722 1,861 5,584 2,792 1,396 698 349 1,048 524 262 131 394 197 592 296 148

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #835,457 Browse Full Index Next Integer #835,459 →