6,949,902

2 × 3 × 1158317

6,949,902 factors as 2 × 3 × 1158317. Its 8 positive divisors give a proper-divisor sum of 6,949,914, so this integer is abundant. The Collatz stopping time is 209 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1158317

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,899,816

Proper Divisor Sum 6,949,914

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6949897 ← → #6949907

Radix Representation

Decimal	6949902
Binary	11010100000110000001110 (23 bits)
Octal	0o32406016
Hexadecimal	0x6A0C0E

Divisor Catalog (8)

1 2 3 6 1,158,317 2,316,634 3,474,951 6,949,902

Collatz Trajectory (209 steps to reach 1)

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

6,949,902 3,474,951 10,424,854 5,212,427 15,637,282 7,818,641 23,455,924 11,727,962 5,863,981 17,591,944 8,795,972 4,397,986 2,198,993 6,596,980 3,298,490 1,649,245 4,947,736 2,473,868 1,236,934 618,467 1,855,402 927,701 2,783,104 1,391,552 695,776 347,888 173,944 86,972 43,486 21,743 65,230 32,615 97,846 48,923 146,770 73,385 220,156 110,078 55,039 165,118 82,559 247,678 123,839 371,518 185,759 557,278 278,639 835,918 417,959 1,253,878 626,939 1,880,818 940,409 2,821,228 1,410,614 705,307 2,115,922 1,057,961 3,173,884 1,586,942

← Previous Integer #6,949,901 Browse Full Index Next Integer #6,949,903 →