7,060,152

2³ × 3 × 11 × 47 × 569

7,060,152 factors as 2^3 × 3 × 11 × 47 × 569. Its 64 positive divisors give a proper-divisor sum of 12,639,048, so this integer is abundant. The Collatz stopping time is 191 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 11 × 47 × 569

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 19,699,200

Proper Divisor Sum 12,639,048

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #7060139 ← → #7060187

Radix Representation

Decimal	7060152
Binary	11010111011101010111000 (23 bits)
Octal	0o32735270
Hexadecimal	0x6BBAB8

Divisor Catalog (60 of 64)

1 2 3 4 6 8 11 12 22 24 33 44 47 66 88 94 132 141 188 264 282 376 517 564 569 1,034 1,128 1,138 1,551 1,707 2,068 2,276 3,102 3,414 4,136 4,552 6,204 6,259 6,828 12,408 12,518 13,656 18,777 25,036 26,743 37,554 50,072 53,486 75,108 80,229 106,972 150,216 160,458 213,944 294,173 320,916 588,346 641,832 882,519 1,176,692

Collatz Trajectory (191 steps to reach 1)

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

7,060,152 3,530,076 1,765,038 882,519 2,647,558 1,323,779 3,971,338 1,985,669 5,957,008 2,978,504 1,489,252 744,626 372,313 1,116,940 558,470 279,235 837,706 418,853 1,256,560 628,280 314,140 157,070 78,535 235,606 117,803 353,410 176,705 530,116 265,058 132,529 397,588 198,794 99,397 298,192 149,096 74,548 37,274 18,637 55,912 27,956 13,978 6,989 20,968 10,484 5,242 2,621 7,864 3,932 1,966 983 2,950 1,475 4,426 2,213 6,640 3,320 1,660 830 415 1,246

← Previous Integer #7,060,151 Browse Full Index Next Integer #7,060,153 →