10,074,954

2 × 3 × 1679159

10,074,954 factors as 2 × 3 × 1679159. Its 8 positive divisors give a proper-divisor sum of 10,074,966, so this integer is abundant. The Collatz stopping time is 57 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1679159

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 20,149,920

Proper Divisor Sum 10,074,966

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #10074947 ← → #10074983

Radix Representation

Decimal	10074954
Binary	100110011011101101001010 (24 bits)
Octal	0o46335512
Hexadecimal	0x99BB4A

Divisor Catalog (8)

1 2 3 6 1,679,159 3,358,318 5,037,477 10,074,954

Collatz Trajectory (57 steps to reach 1)

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

10,074,954 5,037,477 15,112,432 7,556,216 3,778,108 1,889,054 944,527 2,833,582 1,416,791 4,250,374 2,125,187 6,375,562 3,187,781 9,563,344 4,781,672 2,390,836 1,195,418 597,709 1,793,128 896,564 448,282 224,141 672,424 336,212 168,106 84,053 252,160 126,080 63,040 31,520 15,760 7,880 3,940 1,970 985 2,956 1,478 739 2,218 1,109 3,328 1,664 832 416 208 104 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 #10,074,953 Browse Full Index Next Integer #10,074,955 →