6,270

2 × 3 × 5 × 11 × 19

6,270 factors as 2 × 3 × 5 × 11 × 19. Its 32 positive divisors give a proper-divisor sum of 11,010, so this integer is abundant. The Collatz stopping time is 62 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 11 × 19

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 17,280

Proper Divisor Sum 11,010

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #6269 ← → #6271

Radix Representation

Decimal	6270
Binary	1100001111110 (13 bits)
Octal	0o14176
Hexadecimal	0x187E

Divisor Catalog (32)

1 2 3 5 6 10 11 15 19 22 30 33 38 55 57 66 95 110 114 165 190 209 285 330 418 570 627 1,045 1,254 2,090 3,135 6,270

Collatz Trajectory (62 steps to reach 1)

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

6,270 3,135 9,406 4,703 14,110 7,055 21,166 10,583 31,750 15,875 47,626 23,813 71,440 35,720 17,860 8,930 4,465 13,396 6,698 3,349 10,048 5,024 2,512 1,256 628 314 157 472 236 118 59 178 89 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,269 Browse Full Index Next Integer #6,271 →