462,918

2 × 3 × 77153

462,918 factors as 2 × 3 × 77153. Its 8 positive divisors give a proper-divisor sum of 462,930, so this integer is abundant. The Collatz stopping time is 169 steps.

Prime Factor Structure

Factorization String 2 × 3 × 77153

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 925,848

Proper Divisor Sum 462,930

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #462911 ← → #462937

Radix Representation

Decimal	462918
Binary	1110001000001000110 (19 bits)
Octal	0o1610106
Hexadecimal	0x71046

Divisor Catalog (8)

1 2 3 6 77,153 154,306 231,459 462,918

Collatz Trajectory (169 steps to reach 1)

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

462,918 231,459 694,378 347,189 1,041,568 520,784 260,392 130,196 65,098 32,549 97,648 48,824 24,412 12,206 6,103 18,310 9,155 27,466 13,733 41,200 20,600 10,300 5,150 2,575 7,726 3,863 11,590 5,795 17,386 8,693 26,080 13,040 6,520 3,260 1,630 815 2,446 1,223 3,670 1,835 5,506 2,753 8,260 4,130 2,065 6,196 3,098 1,549 4,648 2,324 1,162 581 1,744 872 436 218 109 328 164 82

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #462,917 Browse Full Index Next Integer #462,919 →