3,618,654

2 × 3 × 13 × 17 × 2729

3,618,654 factors as 2 × 3 × 13 × 17 × 2729. Its 32 positive divisors give a proper-divisor sum of 4,636,866, so this integer is abundant. The Collatz stopping time is 141 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 17 × 2729

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 8,255,520

Proper Divisor Sum 4,636,866

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3618653 ← → #3618679

Radix Representation

Decimal	3618654
Binary	1101110011011101011110 (22 bits)
Octal	0o15633536
Hexadecimal	0x37375E

Divisor Catalog (32)

1 2 3 6 13 17 26 34 39 51 78 102 221 442 663 1,326 2,729 5,458 8,187 16,374 35,477 46,393 70,954 92,786 106,431 139,179 212,862 278,358 603,109 1,206,218 1,809,327 3,618,654

Collatz Trajectory (141 steps to reach 1)

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

3,618,654 1,809,327 5,427,982 2,713,991 8,141,974 4,070,987 12,212,962 6,106,481 18,319,444 9,159,722 4,579,861 13,739,584 6,869,792 3,434,896 1,717,448 858,724 429,362 214,681 644,044 322,022 161,011 483,034 241,517 724,552 362,276 181,138 90,569 271,708 135,854 67,927 203,782 101,891 305,674 152,837 458,512 229,256 114,628 57,314 28,657 85,972 42,986 21,493 64,480 32,240 16,120 8,060 4,030 2,015 6,046 3,023 9,070 4,535 13,606 6,803 20,410 10,205 30,616 15,308 7,654 3,827

← Previous Integer #3,618,653 Browse Full Index Next Integer #3,618,655 →