6,161,478

2 × 3 × 1026913

6,161,478 factors as 2 × 3 × 1026913. Its 8 positive divisors give a proper-divisor sum of 6,161,490, so this integer is abundant. The Collatz stopping time is 196 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1026913

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,322,968

Proper Divisor Sum 6,161,490

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6161473 ← → #6161479

Radix Representation

Decimal	6161478
Binary	10111100000010001000110 (23 bits)
Octal	0o27402106
Hexadecimal	0x5E0446

Divisor Catalog (8)

1 2 3 6 1,026,913 2,053,826 3,080,739 6,161,478

Collatz Trajectory (196 steps to reach 1)

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

6,161,478 3,080,739 9,242,218 4,621,109 13,863,328 6,931,664 3,465,832 1,732,916 866,458 433,229 1,299,688 649,844 324,922 162,461 487,384 243,692 121,846 60,923 182,770 91,385 274,156 137,078 68,539 205,618 102,809 308,428 154,214 77,107 231,322 115,661 346,984 173,492 86,746 43,373 130,120 65,060 32,530 16,265 48,796 24,398 12,199 36,598 18,299 54,898 27,449 82,348 41,174 20,587 61,762 30,881 92,644 46,322 23,161 69,484 34,742 17,371 52,114 26,057 78,172 39,086

← Previous Integer #6,161,477 Browse Full Index Next Integer #6,161,479 →