1,904,772

2² × 3 × 158731

1,904,772 factors as 2^2 × 3 × 158731. Its 12 positive divisors give a proper-divisor sum of 2,539,724, so this integer is abundant. The Collatz stopping time is 153 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 158731

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,444,496

Proper Divisor Sum 2,539,724

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1904761 ← → #1904803

Radix Representation

Decimal	1904772
Binary	111010001000010000100 (21 bits)
Octal	0o7210204
Hexadecimal	0x1D1084

Divisor Catalog (12)

1 2 3 4 6 12 158,731 317,462 476,193 634,924 952,386 1,904,772

Collatz Trajectory (153 steps to reach 1)

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

1,904,772 952,386 476,193 1,428,580 714,290 357,145 1,071,436 535,718 267,859 803,578 401,789 1,205,368 602,684 301,342 150,671 452,014 226,007 678,022 339,011 1,017,034 508,517 1,525,552 762,776 381,388 190,694 95,347 286,042 143,021 429,064 214,532 107,266 53,633 160,900 80,450 40,225 120,676 60,338 30,169 90,508 45,254 22,627 67,882 33,941 101,824 50,912 25,456 12,728 6,364 3,182 1,591 4,774 2,387 7,162 3,581 10,744 5,372 2,686 1,343 4,030 2,015

← Previous Integer #1,904,771 Browse Full Index Next Integer #1,904,773 →