7,552,956

2² × 3 × 19 × 157 × 211

7,552,956 factors as 2^2 × 3 × 19 × 157 × 211. Its 48 positive divisors give a proper-divisor sum of 11,204,804, so this integer is abundant. The Collatz stopping time is 111 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 19 × 157 × 211

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 18,757,760

Proper Divisor Sum 11,204,804

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #7552943 ← → #7552957

Radix Representation

Decimal	7552956
Binary	11100110011111110111100 (23 bits)
Octal	0o34637674
Hexadecimal	0x733FBC

Divisor Catalog (48)

1 2 3 4 6 12 19 38 57 76 114 157 211 228 314 422 471 628 633 844 942 1,266 1,884 2,532 2,983 4,009 5,966 8,018 8,949 11,932 12,027 16,036 17,898 24,054 33,127 35,796 48,108 66,254 99,381 132,508 198,762 397,524 629,413 1,258,826 1,888,239 2,517,652 3,776,478 7,552,956

Collatz Trajectory (111 steps to reach 1)

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

7,552,956 3,776,478 1,888,239 5,664,718 2,832,359 8,497,078 4,248,539 12,745,618 6,372,809 19,118,428 9,559,214 4,779,607 14,338,822 7,169,411 21,508,234 10,754,117 32,262,352 16,131,176 8,065,588 4,032,794 2,016,397 6,049,192 3,024,596 1,512,298 756,149 2,268,448 1,134,224 567,112 283,556 141,778 70,889 212,668 106,334 53,167 159,502 79,751 239,254 119,627 358,882 179,441 538,324 269,162 134,581 403,744 201,872 100,936 50,468 25,234 12,617 37,852 18,926 9,463 28,390 14,195 42,586 21,293 63,880 31,940 15,970 7,985

← Previous Integer #7,552,955 Browse Full Index Next Integer #7,552,957 →