7,536,048

2⁴ × 3 × 13² × 929

7,536,048 factors as 2^4 × 3 × 13^2 × 929. Its 60 positive divisors give a proper-divisor sum of 13,567,512, so this integer is abundant. The Collatz stopping time is 155 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 13^2 × 929

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 60

Divisor Sum (σ) 21,103,560

Proper Divisor Sum 13,567,512

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #7536031 ← → #7536059

Radix Representation

Decimal	7536048
Binary	11100101111110110110000 (23 bits)
Octal	0o34576660
Hexadecimal	0x72FDB0

Divisor Catalog (60)

1 2 3 4 6 8 12 13 16 24 26 39 48 52 78 104 156 169 208 312 338 507 624 676 929 1,014 1,352 1,858 2,028 2,704 2,787 3,716 4,056 5,574 7,432 8,112 11,148 12,077 14,864 22,296 24,154 36,231 44,592 48,308 72,462 96,616 144,924 157,001 193,232 289,848 314,002 471,003 579,696 628,004 942,006 1,256,008 1,884,012 2,512,016 3,768,024 7,536,048

Collatz Trajectory (155 steps to reach 1)

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

7,536,048 3,768,024 1,884,012 942,006 471,003 1,413,010 706,505 2,119,516 1,059,758 529,879 1,589,638 794,819 2,384,458 1,192,229 3,576,688 1,788,344 894,172 447,086 223,543 670,630 335,315 1,005,946 502,973 1,508,920 754,460 377,230 188,615 565,846 282,923 848,770 424,385 1,273,156 636,578 318,289 954,868 477,434 238,717 716,152 358,076 179,038 89,519 268,558 134,279 402,838 201,419 604,258 302,129 906,388 453,194 226,597 679,792 339,896 169,948 84,974 42,487 127,462 63,731 191,194 95,597 286,792

← Previous Integer #7,536,047 Browse Full Index Next Integer #7,536,049 →