7,254,078

2 × 3 × 13 × 93001

7,254,078 factors as 2 × 3 × 13 × 93001. Its 16 positive divisors give a proper-divisor sum of 8,370,258, so this integer is abundant. The Collatz stopping time is 266 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 93001

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 15,624,336

Proper Divisor Sum 8,370,258

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #7254077 ← → #7254097

Radix Representation

Decimal	7254078
Binary	11011101011000000111110 (23 bits)
Octal	0o33530076
Hexadecimal	0x6EB03E

Divisor Catalog (16)

1 2 3 6 13 26 39 78 93,001 186,002 279,003 558,006 1,209,013 2,418,026 3,627,039 7,254,078

Collatz Trajectory (266 steps to reach 1)

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

7,254,078 3,627,039 10,881,118 5,440,559 16,321,678 8,160,839 24,482,518 12,241,259 36,723,778 18,361,889 55,085,668 27,542,834 13,771,417 41,314,252 20,657,126 10,328,563 30,985,690 15,492,845 46,478,536 23,239,268 11,619,634 5,809,817 17,429,452 8,714,726 4,357,363 13,072,090 6,536,045 19,608,136 9,804,068 4,902,034 2,451,017 7,353,052 3,676,526 1,838,263 5,514,790 2,757,395 8,272,186 4,136,093 12,408,280 6,204,140 3,102,070 1,551,035 4,653,106 2,326,553 6,979,660 3,489,830 1,744,915 5,234,746 2,617,373 7,852,120 3,926,060 1,963,030 981,515 2,944,546 1,472,273 4,416,820 2,208,410 1,104,205 3,312,616 1,656,308

← Previous Integer #7,254,077 Browse Full Index Next Integer #7,254,079 →