6,045,450

2 × 3 × 5² × 41 × 983

6,045,450 factors as 2 × 3 × 5^2 × 41 × 983. Its 48 positive divisors give a proper-divisor sum of 9,328,566, so this integer is abundant. The Collatz stopping time is 152 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^2 × 41 × 983

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 15,374,016

Proper Divisor Sum 9,328,566

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #6045433 ← → #6045461

Radix Representation

Decimal	6045450
Binary	10111000011111100001010 (23 bits)
Octal	0o27037412
Hexadecimal	0x5C3F0A

Divisor Catalog (48)

1 2 3 5 6 10 15 25 30 41 50 75 82 123 150 205 246 410 615 983 1,025 1,230 1,966 2,050 2,949 3,075 4,915 5,898 6,150 9,830 14,745 24,575 29,490 40,303 49,150 73,725 80,606 120,909 147,450 201,515 241,818 403,030 604,545 1,007,575 1,209,090 2,015,150 3,022,725 6,045,450

Collatz Trajectory (152 steps to reach 1)

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

6,045,450 3,022,725 9,068,176 4,534,088 2,267,044 1,133,522 566,761 1,700,284 850,142 425,071 1,275,214 637,607 1,912,822 956,411 2,869,234 1,434,617 4,303,852 2,151,926 1,075,963 3,227,890 1,613,945 4,841,836 2,420,918 1,210,459 3,631,378 1,815,689 5,447,068 2,723,534 1,361,767 4,085,302 2,042,651 6,127,954 3,063,977 9,191,932 4,595,966 2,297,983 6,893,950 3,446,975 10,340,926 5,170,463 15,511,390 7,755,695 23,267,086 11,633,543 34,900,630 17,450,315 52,350,946 26,175,473 78,526,420 39,263,210 19,631,605 58,894,816 29,447,408 14,723,704 7,361,852 3,680,926 1,840,463 5,521,390 2,760,695 8,282,086

← Previous Integer #6,045,449 Browse Full Index Next Integer #6,045,451 →