24,970,542

2 × 3 × 4161757

24,970,542 factors as 2 × 3 × 4161757. Its 8 positive divisors give a proper-divisor sum of 24,970,554, so this integer is abundant. The Collatz stopping time is 167 steps.

Prime Factor Structure

Factorization String 2 × 3 × 4161757

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 49,941,096

Proper Divisor Sum 24,970,554

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #24970529 ← → #24970549

Radix Representation

Decimal	24970542
Binary	1011111010000010100101110 (25 bits)
Octal	0o137202456
Hexadecimal	0x17D052E

Divisor Catalog (8)

1 2 3 6 4,161,757 8,323,514 12,485,271 24,970,542

Collatz Trajectory (167 steps to reach 1)

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

24,970,542 12,485,271 37,455,814 18,727,907 56,183,722 28,091,861 84,275,584 42,137,792 21,068,896 10,534,448 5,267,224 2,633,612 1,316,806 658,403 1,975,210 987,605 2,962,816 1,481,408 740,704 370,352 185,176 92,588 46,294 23,147 69,442 34,721 104,164 52,082 26,041 78,124 39,062 19,531 58,594 29,297 87,892 43,946 21,973 65,920 32,960 16,480 8,240 4,120 2,060 1,030 515 1,546 773 2,320 1,160 580 290 145 436 218 109 328 164 82 41 124

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #24,970,541 Browse Full Index Next Integer #24,970,543 →