269,388

2² × 3² × 7 × 1069

269,388 factors as 2^2 × 3^2 × 7 × 1069. Its 36 positive divisors give a proper-divisor sum of 509,572, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 7 × 1069

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 778,960

Proper Divisor Sum 509,572

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #269387 ← → #269389

Radix Representation

Decimal	269388
Binary	1000001110001001100 (19 bits)
Octal	0o1016114
Hexadecimal	0x41C4C

Divisor Catalog (36)

1 2 3 4 6 7 9 12 14 18 21 28 36 42 63 84 126 252 1,069 2,138 3,207 4,276 6,414 7,483 9,621 12,828 14,966 19,242 22,449 29,932 38,484 44,898 67,347 89,796 134,694 269,388

Collatz Trajectory (101 steps to reach 1)

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

269,388 134,694 67,347 202,042 101,021 303,064 151,532 75,766 37,883 113,650 56,825 170,476 85,238 42,619 127,858 63,929 191,788 95,894 47,947 143,842 71,921 215,764 107,882 53,941 161,824 80,912 40,456 20,228 10,114 5,057 15,172 7,586 3,793 11,380 5,690 2,845 8,536 4,268 2,134 1,067 3,202 1,601 4,804 2,402 1,201 3,604 1,802 901 2,704 1,352 676 338 169 508 254 127 382 191 574 287

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #269,387 Browse Full Index Next Integer #269,389 →