501,906

2 × 3 × 23 × 3637

501,906 factors as 2 × 3 × 23 × 3637. Its 16 positive divisors give a proper-divisor sum of 545,838, so this integer is abundant. The Collatz stopping time is 89 steps.

Prime Factor Structure

Factorization String 2 × 3 × 23 × 3637

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,047,744

Proper Divisor Sum 545,838

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #501889 ← → #501911

Radix Representation

Decimal	501906
Binary	1111010100010010010 (19 bits)
Octal	0o1724222
Hexadecimal	0x7A892

Divisor Catalog (16)

1 2 3 6 23 46 69 138 3,637 7,274 10,911 21,822 83,651 167,302 250,953 501,906

Collatz Trajectory (89 steps to reach 1)

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

501,906 250,953 752,860 376,430 188,215 564,646 282,323 846,970 423,485 1,270,456 635,228 317,614 158,807 476,422 238,211 714,634 357,317 1,071,952 535,976 267,988 133,994 66,997 200,992 100,496 50,248 25,124 12,562 6,281 18,844 9,422 4,711 14,134 7,067 21,202 10,601 31,804 15,902 7,951 23,854 11,927 35,782 17,891 53,674 26,837 80,512 40,256 20,128 10,064 5,032 2,516 1,258 629 1,888 944 472 236 118 59 178 89

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #501,905 Browse Full Index Next Integer #501,907 →