10,285,254

2 × 3² × 7 × 81629

10,285,254 factors as 2 × 3^2 × 7 × 81629. Its 24 positive divisors give a proper-divisor sum of 15,183,306, so this integer is abundant. The Collatz stopping time is 75 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 7 × 81629

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 25,468,560

Proper Divisor Sum 15,183,306

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #10285229 ← → #10285259

Radix Representation

Decimal	10285254
Binary	100111001111000011000110 (24 bits)
Octal	0o47170306
Hexadecimal	0x9CF0C6

Divisor Catalog (24)

Collatz Trajectory (75 steps to reach 1)

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

10,285,254 5,142,627 15,427,882 7,713,941 23,141,824 11,570,912 5,785,456 2,892,728 1,446,364 723,182 361,591 1,084,774 542,387 1,627,162 813,581 2,440,744 1,220,372 610,186 305,093 915,280 457,640 228,820 114,410 57,205 171,616 85,808 42,904 21,452 10,726 5,363 16,090 8,045 24,136 12,068 6,034 3,017 9,052 4,526 2,263 6,790 3,395 10,186 5,093 15,280 7,640 3,820 1,910 955 2,866 1,433 4,300 2,150 1,075 3,226 1,613 4,840 2,420 1,210 605 1,816

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #10,285,253 Browse Full Index Next Integer #10,285,255 →