6,901,944

2³ × 3 × 7² × 5869

6,901,944 factors as 2^3 × 3 × 7^2 × 5869. Its 48 positive divisors give a proper-divisor sum of 13,173,456, so this integer is abundant. The Collatz stopping time is 191 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 7^2 × 5869

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 20,075,400

Proper Divisor Sum 13,173,456

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6901919 ← → #6901957

Radix Representation

Decimal	6901944
Binary	11010010101000010111000 (23 bits)
Octal	0o32250270
Hexadecimal	0x6950B8

Divisor Catalog (48)

1 2 3 4 6 7 8 12 14 21 24 28 42 49 56 84 98 147 168 196 294 392 588 1,176 5,869 11,738 17,607 23,476 35,214 41,083 46,952 70,428 82,166 123,249 140,856 164,332 246,498 287,581 328,664 492,996 575,162 862,743 985,992 1,150,324 1,725,486 2,300,648 3,450,972 6,901,944

Collatz Trajectory (191 steps to reach 1)

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

6,901,944 3,450,972 1,725,486 862,743 2,588,230 1,294,115 3,882,346 1,941,173 5,823,520 2,911,760 1,455,880 727,940 363,970 181,985 545,956 272,978 136,489 409,468 204,734 102,367 307,102 153,551 460,654 230,327 690,982 345,491 1,036,474 518,237 1,554,712 777,356 388,678 194,339 583,018 291,509 874,528 437,264 218,632 109,316 54,658 27,329 81,988 40,994 20,497 61,492 30,746 15,373 46,120 23,060 11,530 5,765 17,296 8,648 4,324 2,162 1,081 3,244 1,622 811 2,434 1,217

← Previous Integer #6,901,943 Browse Full Index Next Integer #6,901,945 →