956,262

2 × 3 × 47 × 3391

956,262 factors as 2 × 3 × 47 × 3391. Its 16 positive divisors give a proper-divisor sum of 997,530, so this integer is abundant. The Collatz stopping time is 170 steps.

Prime Factor Structure

Factorization String 2 × 3 × 47 × 3391

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,953,792

Proper Divisor Sum 997,530

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #956261 ← → #956269

Radix Representation

Decimal	956262
Binary	11101001011101100110 (20 bits)
Octal	0o3513546
Hexadecimal	0xE9766

Divisor Catalog (16)

1 2 3 6 47 94 141 282 3,391 6,782 10,173 20,346 159,377 318,754 478,131 956,262

Collatz Trajectory (170 steps to reach 1)

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

956,262 478,131 1,434,394 717,197 2,151,592 1,075,796 537,898 268,949 806,848 403,424 201,712 100,856 50,428 25,214 12,607 37,822 18,911 56,734 28,367 85,102 42,551 127,654 63,827 191,482 95,741 287,224 143,612 71,806 35,903 107,710 53,855 161,566 80,783 242,350 121,175 363,526 181,763 545,290 272,645 817,936 408,968 204,484 102,242 51,121 153,364 76,682 38,341 115,024 57,512 28,756 14,378 7,189 21,568 10,784 5,392 2,696 1,348 674 337 1,012

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #956,261 Browse Full Index Next Integer #956,263 →