575,274

2 × 3 × 7 × 13697

575,274 factors as 2 × 3 × 7 × 13697. Its 16 positive divisors give a proper-divisor sum of 739,734, so this integer is abundant. The Collatz stopping time is 53 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 13697

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,315,008

Proper Divisor Sum 739,734

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #575261 ← → #575303

Radix Representation

Decimal	575274
Binary	10001100011100101010 (20 bits)
Octal	0o2143452
Hexadecimal	0x8C72A

Divisor Catalog (16)

1 2 3 6 7 14 21 42 13,697 27,394 41,091 82,182 95,879 191,758 287,637 575,274

Collatz Trajectory (53 steps to reach 1)

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

575,274 287,637 862,912 431,456 215,728 107,864 53,932 26,966 13,483 40,450 20,225 60,676 30,338 15,169 45,508 22,754 11,377 34,132 17,066 8,533 25,600 12,800 6,400 3,200 1,600 800 400 200 100 50 25 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #575,273 Browse Full Index Next Integer #575,275 →