6,982,400

2⁸ × 5² × 1091

6,982,400 factors as 2^8 × 5^2 × 1091. Its 54 positive divisors give a proper-divisor sum of 10,315,972, so this integer is abundant. The Collatz stopping time is 147 steps.

Prime Factor Structure

Factorization String 2^8 × 5^2 × 1091

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 54

Divisor Sum (σ) 17,298,372

Proper Divisor Sum 10,315,972

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #6982397 ← → #6982403

Radix Representation

Decimal	6982400
Binary	11010101000101100000000 (23 bits)
Octal	0o32505400
Hexadecimal	0x6A8B00

Divisor Catalog (54)

1 2 4 5 8 10 16 20 25 32 40 50 64 80 100 128 160 200 256 320 400 640 800 1,091 1,280 1,600 2,182 3,200 4,364 5,455 6,400 8,728 10,910 17,456 21,820 27,275 34,912 43,640 54,550 69,824 87,280 109,100 139,648 174,560 218,200 279,296 349,120 436,400 698,240 872,800 1,396,480 1,745,600 3,491,200 6,982,400

Collatz Trajectory (147 steps to reach 1)

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

6,982,400 3,491,200 1,745,600 872,800 436,400 218,200 109,100 54,550 27,275 81,826 40,913 122,740 61,370 30,685 92,056 46,028 23,014 11,507 34,522 17,261 51,784 25,892 12,946 6,473 19,420 9,710 4,855 14,566 7,283 21,850 10,925 32,776 16,388 8,194 4,097 12,292 6,146 3,073 9,220 4,610 2,305 6,916 3,458 1,729 5,188 2,594 1,297 3,892 1,946 973 2,920 1,460 730 365 1,096 548 274 137 412 206

← Previous Integer #6,982,399 Browse Full Index Next Integer #6,982,401 →