6,369,012

2² × 3² × 13 × 31 × 439

6,369,012 factors as 2^2 × 3^2 × 13 × 31 × 439. Its 72 positive divisors give a proper-divisor sum of 11,568,908, so this integer is abundant. The Collatz stopping time is 147 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 13 × 31 × 439

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 17,937,920

Proper Divisor Sum 11,568,908

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #6369007 ← → #6369023

Radix Representation

Decimal	6369012
Binary	11000010010111011110100 (23 bits)
Octal	0o30227364
Hexadecimal	0x612EF4

Divisor Catalog (60 of 72)

1 2 3 4 6 9 12 13 18 26 31 36 39 52 62 78 93 117 124 156 186 234 279 372 403 439 468 558 806 878 1,116 1,209 1,317 1,612 1,756 2,418 2,634 3,627 3,951 4,836 5,268 5,707 7,254 7,902 11,414 13,609 14,508 15,804 17,121 22,828 27,218 34,242 40,827 51,363 54,436 68,484 81,654 102,726 122,481 163,308

Collatz Trajectory (147 steps to reach 1)

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

6,369,012 3,184,506 1,592,253 4,776,760 2,388,380 1,194,190 597,095 1,791,286 895,643 2,686,930 1,343,465 4,030,396 2,015,198 1,007,599 3,022,798 1,511,399 4,534,198 2,267,099 6,801,298 3,400,649 10,201,948 5,100,974 2,550,487 7,651,462 3,825,731 11,477,194 5,738,597 17,215,792 8,607,896 4,303,948 2,151,974 1,075,987 3,227,962 1,613,981 4,841,944 2,420,972 1,210,486 605,243 1,815,730 907,865 2,723,596 1,361,798 680,899 2,042,698 1,021,349 3,064,048 1,532,024 766,012 383,006 191,503 574,510 287,255 861,766 430,883 1,292,650 646,325 1,938,976 969,488 484,744 242,372

← Previous Integer #6,369,011 Browse Full Index Next Integer #6,369,013 →