401,172

2² × 3 × 101 × 331

401,172 factors as 2^2 × 3 × 101 × 331. Its 24 positive divisors give a proper-divisor sum of 547,020, so this integer is abundant. The Collatz stopping time is 130 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 101 × 331

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 948,192

Proper Divisor Sum 547,020

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #401161 ← → #401173

Radix Representation

Decimal	401172
Binary	1100001111100010100 (19 bits)
Octal	0o1417424
Hexadecimal	0x61F14

Divisor Catalog (24)

1 2 3 4 6 12 101 202 303 331 404 606 662 993 1,212 1,324 1,986 3,972 33,431 66,862 100,293 133,724 200,586 401,172

Collatz Trajectory (130 steps to reach 1)

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

401,172 200,586 100,293 300,880 150,440 75,220 37,610 18,805 56,416 28,208 14,104 7,052 3,526 1,763 5,290 2,645 7,936 3,968 1,984 992 496 248 124 62 31 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #401,171 Browse Full Index Next Integer #401,173 →