9,212,454

2 × 3⁴ × 19 × 41 × 73

9,212,454 factors as 2 × 3^4 × 19 × 41 × 73. Its 80 positive divisors give a proper-divisor sum of 13,351,626, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 19 × 41 × 73

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 22,564,080

Proper Divisor Sum 13,351,626

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9212447 ← → #9212461

Radix Representation

Decimal	9212454
Binary	100011001001001000100110 (24 bits)
Octal	0o43111046
Hexadecimal	0x8C9226

Divisor Catalog (60 of 80)

1 2 3 6 9 18 19 27 38 41 54 57 73 81 82 114 123 146 162 171 219 246 342 369 438 513 657 738 779 1,026 1,107 1,314 1,387 1,539 1,558 1,971 2,214 2,337 2,774 2,993 3,078 3,321 3,942 4,161 4,674 5,913 5,986 6,642 7,011 8,322 8,979 11,826 12,483 14,022 17,958 21,033 24,966 26,937 37,449 42,066

Collatz Trajectory (106 steps to reach 1)

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

9,212,454 4,606,227 13,818,682 6,909,341 20,728,024 10,364,012 5,182,006 2,591,003 7,773,010 3,886,505 11,659,516 5,829,758 2,914,879 8,744,638 4,372,319 13,116,958 6,558,479 19,675,438 9,837,719 29,513,158 14,756,579 44,269,738 22,134,869 66,404,608 33,202,304 16,601,152 8,300,576 4,150,288 2,075,144 1,037,572 518,786 259,393 778,180 389,090 194,545 583,636 291,818 145,909 437,728 218,864 109,432 54,716 27,358 13,679 41,038 20,519 61,558 30,779 92,338 46,169 138,508 69,254 34,627 103,882 51,941 155,824 77,912 38,956 19,478 9,739

← Previous Integer #9,212,453 Browse Full Index Next Integer #9,212,455 →