5,503,374

2 × 3² × 305743

5,503,374 factors as 2 × 3^2 × 305743. Its 12 positive divisors give a proper-divisor sum of 6,420,642, so this integer is abundant. The Collatz stopping time is 201 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 305743

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 11,924,016

Proper Divisor Sum 6,420,642

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5503373 ← → #5503391

Radix Representation

Decimal	5503374
Binary	10100111111100110001110 (23 bits)
Octal	0o24774616
Hexadecimal	0x53F98E

Divisor Catalog (12)

1 2 3 6 9 18 305,743 611,486 917,229 1,834,458 2,751,687 5,503,374

Collatz Trajectory (201 steps to reach 1)

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

5,503,374 2,751,687 8,255,062 4,127,531 12,382,594 6,191,297 18,573,892 9,286,946 4,643,473 13,930,420 6,965,210 3,482,605 10,447,816 5,223,908 2,611,954 1,305,977 3,917,932 1,958,966 979,483 2,938,450 1,469,225 4,407,676 2,203,838 1,101,919 3,305,758 1,652,879 4,958,638 2,479,319 7,437,958 3,718,979 11,156,938 5,578,469 16,735,408 8,367,704 4,183,852 2,091,926 1,045,963 3,137,890 1,568,945 4,706,836 2,353,418 1,176,709 3,530,128 1,765,064 882,532 441,266 220,633 661,900 330,950 165,475 496,426 248,213 744,640 372,320 186,160 93,080 46,540 23,270 11,635 34,906

← Previous Integer #5,503,373 Browse Full Index Next Integer #5,503,375 →