397,852

2² × 7 × 13 × 1093

397,852 factors as 2^2 × 7 × 13 × 1093. Its 24 positive divisors give a proper-divisor sum of 459,844, so this integer is abundant. The Collatz stopping time is 99 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 13 × 1093

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 857,696

Proper Divisor Sum 459,844

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #397849 ← → #397867

Radix Representation

Decimal	397852
Binary	1100001001000011100 (19 bits)
Octal	0o1411034
Hexadecimal	0x6121C

Divisor Catalog (24)

1 2 4 7 13 14 26 28 52 91 182 364 1,093 2,186 4,372 7,651 14,209 15,302 28,418 30,604 56,836 99,463 198,926 397,852

Collatz Trajectory (99 steps to reach 1)

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

397,852 198,926 99,463 298,390 149,195 447,586 223,793 671,380 335,690 167,845 503,536 251,768 125,884 62,942 31,471 94,414 47,207 141,622 70,811 212,434 106,217 318,652 159,326 79,663 238,990 119,495 358,486 179,243 537,730 268,865 806,596 403,298 201,649 604,948 302,474 151,237 453,712 226,856 113,428 56,714 28,357 85,072 42,536 21,268 10,634 5,317 15,952 7,976 3,988 1,994 997 2,992 1,496 748 374 187 562 281 844 422

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #397,851 Browse Full Index Next Integer #397,853 →