292,938

2 × 3 × 48823

292,938 factors as 2 × 3 × 48823. Its 8 positive divisors give a proper-divisor sum of 292,950, so this integer is abundant. The Collatz stopping time is 158 steps.

Prime Factor Structure

Factorization String 2 × 3 × 48823

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 585,888

Proper Divisor Sum 292,950

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #292933 ← → #292969

Radix Representation

Decimal	292938
Binary	1000111100001001010 (19 bits)
Octal	0o1074112
Hexadecimal	0x4784A

Divisor Catalog (8)

1 2 3 6 48,823 97,646 146,469 292,938

Collatz Trajectory (158 steps to reach 1)

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

292,938 146,469 439,408 219,704 109,852 54,926 27,463 82,390 41,195 123,586 61,793 185,380 92,690 46,345 139,036 69,518 34,759 104,278 52,139 156,418 78,209 234,628 117,314 58,657 175,972 87,986 43,993 131,980 65,990 32,995 98,986 49,493 148,480 74,240 37,120 18,560 9,280 4,640 2,320 1,160 580 290 145 436 218 109 328 164 82 41 124 62 31 94 47 142 71 214 107 322

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #292,937 Browse Full Index Next Integer #292,939 →