2,745,756

2² × 3² × 13 × 5867

2,745,756 factors as 2^2 × 3^2 × 13 × 5867. Its 36 positive divisors give a proper-divisor sum of 4,730,076, so this integer is abundant. The Collatz stopping time is 213 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 13 × 5867

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 7,475,832

Proper Divisor Sum 4,730,076

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #2745737 ← → #2745761

Radix Representation

Decimal	2745756
Binary	1010011110010110011100 (22 bits)
Octal	0o12362634
Hexadecimal	0x29E59C

Divisor Catalog (36)

1 2 3 4 6 9 12 13 18 26 36 39 52 78 117 156 234 468 5,867 11,734 17,601 23,468 35,202 52,803 70,404 76,271 105,606 152,542 211,212 228,813 305,084 457,626 686,439 915,252 1,372,878 2,745,756

Collatz Trajectory (213 steps to reach 1)

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

2,745,756 1,372,878 686,439 2,059,318 1,029,659 3,088,978 1,544,489 4,633,468 2,316,734 1,158,367 3,475,102 1,737,551 5,212,654 2,606,327 7,818,982 3,909,491 11,728,474 5,864,237 17,592,712 8,796,356 4,398,178 2,199,089 6,597,268 3,298,634 1,649,317 4,947,952 2,473,976 1,236,988 618,494 309,247 927,742 463,871 1,391,614 695,807 2,087,422 1,043,711 3,131,134 1,565,567 4,696,702 2,348,351 7,045,054 3,522,527 10,567,582 5,283,791 15,851,374 7,925,687 23,777,062 11,888,531 35,665,594 17,832,797 53,498,392 26,749,196 13,374,598 6,687,299 20,061,898 10,030,949 30,092,848 15,046,424 7,523,212 3,761,606

← Previous Integer #2,745,755 Browse Full Index Next Integer #2,745,757 →