4,644,765

3² × 5 × 103217

4,644,765 factors as 3^2 × 5 × 103217. Its 12 positive divisors give a proper-divisor sum of 3,406,239, so this integer is deficient. The Collatz stopping time is 193 steps.

Prime Factor Structure

Factorization String 3^2 × 5 × 103217

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 8,051,004

Proper Divisor Sum 3,406,239

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #4644737 ← → #4644769

Radix Representation

Decimal	4644765
Binary	10001101101111110011101 (23 bits)
Octal	0o21557635
Hexadecimal	0x46DF9D

Divisor Catalog (12)

1 3 5 9 15 45 103,217 309,651 516,085 928,953 1,548,255 4,644,765

Collatz Trajectory (193 steps to reach 1)

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

4,644,765 13,934,296 6,967,148 3,483,574 1,741,787 5,225,362 2,612,681 7,838,044 3,919,022 1,959,511 5,878,534 2,939,267 8,817,802 4,408,901 13,226,704 6,613,352 3,306,676 1,653,338 826,669 2,480,008 1,240,004 620,002 310,001 930,004 465,002 232,501 697,504 348,752 174,376 87,188 43,594 21,797 65,392 32,696 16,348 8,174 4,087 12,262 6,131 18,394 9,197 27,592 13,796 6,898 3,449 10,348 5,174 2,587 7,762 3,881 11,644 5,822 2,911 8,734 4,367 13,102 6,551 19,654 9,827 29,482

← Previous Integer #4,644,764 Browse Full Index Next Integer #4,644,766 →