695,050

2 × 5² × 13901

695,050 factors as 2 × 5^2 × 13901. Its 12 positive divisors give a proper-divisor sum of 597,836, so this integer is deficient. The Collatz stopping time is 229 steps.

Prime Factor Structure

Factorization String 2 × 5^2 × 13901

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,292,886

Proper Divisor Sum 597,836

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #695047 ← → #695059

Radix Representation

Decimal	695050
Binary	10101001101100001010 (20 bits)
Octal	0o2515412
Hexadecimal	0xA9B0A

Divisor Catalog (12)

1 2 5 10 25 50 13,901 27,802 69,505 139,010 347,525 695,050

Collatz Trajectory (229 steps to reach 1)

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

695,050 347,525 1,042,576 521,288 260,644 130,322 65,161 195,484 97,742 48,871 146,614 73,307 219,922 109,961 329,884 164,942 82,471 247,414 123,707 371,122 185,561 556,684 278,342 139,171 417,514 208,757 626,272 313,136 156,568 78,284 39,142 19,571 58,714 29,357 88,072 44,036 22,018 11,009 33,028 16,514 8,257 24,772 12,386 6,193 18,580 9,290 4,645 13,936 6,968 3,484 1,742 871 2,614 1,307 3,922 1,961 5,884 2,942 1,471 4,414

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #695,049 Browse Full Index Next Integer #695,051 →