2,510,394

2 × 3 × 19³ × 61

2,510,394 factors as 2 × 3 × 19^3 × 61. Its 32 positive divisors give a proper-divisor sum of 2,876,166, so this integer is abundant. The Collatz stopping time is 156 steps.

Prime Factor Structure

Factorization String 2 × 3 × 19^3 × 61

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 5,386,560

Proper Divisor Sum 2,876,166

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2510341 ← → #2510401

Radix Representation

Decimal	2510394
Binary	1001100100111000111010 (22 bits)
Octal	0o11447072
Hexadecimal	0x264E3A

Divisor Catalog (32)

1 2 3 6 19 38 57 61 114 122 183 361 366 722 1,083 1,159 2,166 2,318 3,477 6,859 6,954 13,718 20,577 22,021 41,154 44,042 66,063 132,126 418,399 836,798 1,255,197 2,510,394

Collatz Trajectory (156 steps to reach 1)

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

2,510,394 1,255,197 3,765,592 1,882,796 941,398 470,699 1,412,098 706,049 2,118,148 1,059,074 529,537 1,588,612 794,306 397,153 1,191,460 595,730 297,865 893,596 446,798 223,399 670,198 335,099 1,005,298 502,649 1,507,948 753,974 376,987 1,130,962 565,481 1,696,444 848,222 424,111 1,272,334 636,167 1,908,502 954,251 2,862,754 1,431,377 4,294,132 2,147,066 1,073,533 3,220,600 1,610,300 805,150 402,575 1,207,726 603,863 1,811,590 905,795 2,717,386 1,358,693 4,076,080 2,038,040 1,019,020 509,510 254,755 764,266 382,133 1,146,400 573,200

← Previous Integer #2,510,393 Browse Full Index Next Integer #2,510,395 →