930,894

2 × 3 × 113 × 1373

930,894 factors as 2 × 3 × 113 × 1373. Its 16 positive divisors give a proper-divisor sum of 948,738, so this integer is abundant. The Collatz stopping time is 77 steps.

Prime Factor Structure

Factorization String 2 × 3 × 113 × 1373

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,879,632

Proper Divisor Sum 948,738

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #930889 ← → #930911

Radix Representation

Decimal	930894
Binary	11100011010001001110 (20 bits)
Octal	0o3432116
Hexadecimal	0xE344E

Divisor Catalog (16)

1 2 3 6 113 226 339 678 1,373 2,746 4,119 8,238 155,149 310,298 465,447 930,894

Collatz Trajectory (77 steps to reach 1)

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

930,894 465,447 1,396,342 698,171 2,094,514 1,047,257 3,141,772 1,570,886 785,443 2,356,330 1,178,165 3,534,496 1,767,248 883,624 441,812 220,906 110,453 331,360 165,680 82,840 41,420 20,710 10,355 31,066 15,533 46,600 23,300 11,650 5,825 17,476 8,738 4,369 13,108 6,554 3,277 9,832 4,916 2,458 1,229 3,688 1,844 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148 74 37 112 56 28

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #930,893 Browse Full Index Next Integer #930,895 →