4,008,369

3 × 269 × 4967

4,008,369 factors as 3 × 269 × 4967. Its 8 positive divisors give a proper-divisor sum of 1,357,071, so this integer is deficient. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 3 × 269 × 4967

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,365,440

Proper Divisor Sum 1,357,071

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #4008349 ← → #4008377

Radix Representation

Decimal	4008369
Binary	1111010010100110110001 (22 bits)
Octal	0o17224661
Hexadecimal	0x3D29B1

Divisor Catalog (8)

1 3 269 807 4,967 14,901 1,336,123 4,008,369

Collatz Trajectory (92 steps to reach 1)

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

4,008,369 12,025,108 6,012,554 3,006,277 9,018,832 4,509,416 2,254,708 1,127,354 563,677 1,691,032 845,516 422,758 211,379 634,138 317,069 951,208 475,604 237,802 118,901 356,704 178,352 89,176 44,588 22,294 11,147 33,442 16,721 50,164 25,082 12,541 37,624 18,812 9,406 4,703 14,110 7,055 21,166 10,583 31,750 15,875 47,626 23,813 71,440 35,720 17,860 8,930 4,465 13,396 6,698 3,349 10,048 5,024 2,512 1,256 628 314 157 472 236 118

← Previous Integer #4,008,368 Browse Full Index Next Integer #4,008,370 →