9,569,490

2 × 3 × 5 × 7 × 45569

9,569,490 factors as 2 × 3 × 5 × 7 × 45569. Its 32 positive divisors give a proper-divisor sum of 16,678,830, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 7 × 45569

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 26,248,320

Proper Divisor Sum 16,678,830

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9569479 ← → #9569503

Radix Representation

Decimal	9569490
Binary	100100100000010011010010 (24 bits)
Octal	0o44402322
Hexadecimal	0x9204D2

Divisor Catalog (32)

1 2 3 5 6 7 10 14 15 21 30 35 42 70 105 210 45,569 91,138 136,707 227,845 273,414 318,983 455,690 637,966 683,535 956,949 1,367,070 1,594,915 1,913,898 3,189,830 4,784,745 9,569,490

Collatz Trajectory (101 steps to reach 1)

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

9,569,490 4,784,745 14,354,236 7,177,118 3,588,559 10,765,678 5,382,839 16,148,518 8,074,259 24,222,778 12,111,389 36,334,168 18,167,084 9,083,542 4,541,771 13,625,314 6,812,657 20,437,972 10,218,986 5,109,493 15,328,480 7,664,240 3,832,120 1,916,060 958,030 479,015 1,437,046 718,523 2,155,570 1,077,785 3,233,356 1,616,678 808,339 2,425,018 1,212,509 3,637,528 1,818,764 909,382 454,691 1,364,074 682,037 2,046,112 1,023,056 511,528 255,764 127,882 63,941 191,824 95,912 47,956 23,978 11,989 35,968 17,984 8,992 4,496 2,248 1,124 562 281

← Previous Integer #9,569,489 Browse Full Index Next Integer #9,569,491 →