9,764,465

5 × 1952893

9,764,465 factors as 5 × 1952893. Its 4 positive divisors give a proper-divisor sum of 1,952,899, so this integer is deficient. The Collatz stopping time is 207 steps.

Prime Factor Structure

Factorization String 5 × 1952893

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 11,717,364

Proper Divisor Sum 1,952,899

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #9764459 ← → #9764471

Radix Representation

Decimal	9764465
Binary	100101001111111001110001 (24 bits)
Octal	0o45177161
Hexadecimal	0x94FE71

Divisor Catalog (4)

1 5 1,952,893 9,764,465

Collatz Trajectory (207 steps to reach 1)

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

9,764,465 29,293,396 14,646,698 7,323,349 21,970,048 10,985,024 5,492,512 2,746,256 1,373,128 686,564 343,282 171,641 514,924 257,462 128,731 386,194 193,097 579,292 289,646 144,823 434,470 217,235 651,706 325,853 977,560 488,780 244,390 122,195 366,586 183,293 549,880 274,940 137,470 68,735 206,206 103,103 309,310 154,655 463,966 231,983 695,950 347,975 1,043,926 521,963 1,565,890 782,945 2,348,836 1,174,418 587,209 1,761,628 880,814 440,407 1,321,222 660,611 1,981,834 990,917 2,972,752 1,486,376 743,188 371,594

← Previous Integer #9,764,464 Browse Full Index Next Integer #9,764,466 →