28,651,364

2² × 7 × 1023263

28,651,364 factors as 2^2 × 7 × 1023263. Its 12 positive divisors give a proper-divisor sum of 28,651,420, so this integer is abundant. The Collatz stopping time is 118 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 1023263

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 57,302,784

Proper Divisor Sum 28,651,420

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #28651361 ← → #28651367

Radix Representation

Decimal	28651364
Binary	1101101010010111101100100 (25 bits)
Octal	0o155227544
Hexadecimal	0x1B52F64

Divisor Catalog (12)

1 2 4 7 14 28 1,023,263 2,046,526 4,093,052 7,162,841 14,325,682 28,651,364

Collatz Trajectory (118 steps to reach 1)

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

28,651,364 14,325,682 7,162,841 21,488,524 10,744,262 5,372,131 16,116,394 8,058,197 24,174,592 12,087,296 6,043,648 3,021,824 1,510,912 755,456 377,728 188,864 94,432 47,216 23,608 11,804 5,902 2,951 8,854 4,427 13,282 6,641 19,924 9,962 4,981 14,944 7,472 3,736 1,868 934 467 1,402 701 2,104 1,052 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502 251 754 377 1,132 566 283 850

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #28,651,363 Browse Full Index Next Integer #28,651,365 →