438,130

2 × 5 × 7 × 11 × 569

438,130 factors as 2 × 5 × 7 × 11 × 569. Its 32 positive divisors give a proper-divisor sum of 546,830, so this integer is abundant. The Collatz stopping time is 143 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 11 × 569

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 984,960

Proper Divisor Sum 546,830

Digit Sum / Digital Root 19 (Root: 1)

Adjacent Primes #438091 ← → #438131

Radix Representation

Decimal	438130
Binary	1101010111101110010 (19 bits)
Octal	0o1527562
Hexadecimal	0x6AF72

Divisor Catalog (32)

1 2 5 7 10 11 14 22 35 55 70 77 110 154 385 569 770 1,138 2,845 3,983 5,690 6,259 7,966 12,518 19,915 31,295 39,830 43,813 62,590 87,626 219,065 438,130

Collatz Trajectory (143 steps to reach 1)

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

438,130 219,065 657,196 328,598 164,299 492,898 246,449 739,348 369,674 184,837 554,512 277,256 138,628 69,314 34,657 103,972 51,986 25,993 77,980 38,990 19,495 58,486 29,243 87,730 43,865 131,596 65,798 32,899 98,698 49,349 148,048 74,024 37,012 18,506 9,253 27,760 13,880 6,940 3,470 1,735 5,206 2,603 7,810 3,905 11,716 5,858 2,929 8,788 4,394 2,197 6,592 3,296 1,648 824 412 206 103 310 155 466

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #438,129 Browse Full Index Next Integer #438,131 →