425,694

2 × 3 × 70949

425,694 factors as 2 × 3 × 70949. Its 8 positive divisors give a proper-divisor sum of 425,706, so this integer is abundant. The Collatz stopping time is 81 steps.

Prime Factor Structure

Factorization String 2 × 3 × 70949

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 851,400

Proper Divisor Sum 425,706

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #425681 ← → #425701

Radix Representation

Decimal	425694
Binary	1100111111011011110 (19 bits)
Octal	0o1477336
Hexadecimal	0x67EDE

Divisor Catalog (8)

1 2 3 6 70,949 141,898 212,847 425,694

Collatz Trajectory (81 steps to reach 1)

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

425,694 212,847 638,542 319,271 957,814 478,907 1,436,722 718,361 2,155,084 1,077,542 538,771 1,616,314 808,157 2,424,472 1,212,236 606,118 303,059 909,178 454,589 1,363,768 681,884 340,942 170,471 511,414 255,707 767,122 383,561 1,150,684 575,342 287,671 863,014 431,507 1,294,522 647,261 1,941,784 970,892 485,446 242,723 728,170 364,085 1,092,256 546,128 273,064 136,532 68,266 34,133 102,400 51,200 25,600 12,800 6,400 3,200 1,600 800 400 200 100 50 25 76

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #425,693 Browse Full Index Next Integer #425,695 →