Recognised as Number

9,967,656

Positive
Even
Composite
7 digits

9,967,656 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value9,967,656

Digit count7

Digit sum48

Digit product612,360

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 3 × 415,319

Distinct prime factors32, 3, 415,319

Number of divisors16

Sum of divisors σ(n)24,919,200

Aliquot sum14,951,544sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)3,322,544integers below n that share no factor with it

Carmichael function λ(n)415,318the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,322,544

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 12, 24, 415,319, 830,638, 1,245,957, 1,661,276, 2,491,914, 3,322,552, 4,983,828, 9,967,65616 in total

Arithmetic

Previous number9,967,655

Next number9,967,657

Double19,935,312

Half4,983,828

Square99,354,166,134,336

Cube990,328,150,193,911,036,416

Square root3,157.159482826≈irrational, shown to 9 decimal places

Cube root215.210941342≈

Negation-9,967,656

Reciprocal1.0032449 × 10^-7≈

Representations

Decimal9,967,656

Binary10011000000110000010100024 bits

Octal46014050

Hexadecimal981828

Base 365XN3C

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsnine million, nine hundred and sixty-seven thousand, six hundred and fifty-six

Ordinalnine million, nine hundred and sixty-seven thousand, six hundred and fifty-sixth

Scientific notation9.967656 × 10^6

Engineering notation9.967656 × 10^6

In other bases

Ternary200202102001110base 3; the most digit-efficient integer base after e: 15 digits

Quinary10022431111base 5; one hand: 11 digits

Septenary150503136base 7: 9 digits

Nonary20672043base 9; each digit is two ternary digits: 8 digits

Duodecimal34083a0base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal325j2gbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal46:8:47:36base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T01T1T11T001110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1111010000110100001111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000100110000001100000101000

Bit length24 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits17within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being even

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes398 18 28

Gray code110101000001010000111100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000100110000001100000101000

64-bit0000000000000000000000000000000000000000100110000001100000101000

One's complement11111111011001111110011111010111at 32 bits, every bit flipped

Bits reversed00010100000110000001100100000000at 32 bits

Rotated left by 100000001001100000011000001010000at 32 bits, wrapping

Shifted left by 11001100000011000001010000= 19,935,312, no wrap

Shifted right by 110011000000110000010100= 4,983,828, discarding the low bit

These bits as a double4.9246764 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,967,669+13

Previous prime9,967,649−7

Distance to nearest prime7

Nearest square below9,966,649

Nearest square above9,972,964

Powers & multiples

9,967,656 to the power 299,354,166,134,336

9,967,656 to the power 3990,328,150,193,911,036,416

9,967,656 to the power 49,871,250,328,249,238,505,598,160,896

9,967,656 to the power 598,393,227,561,875,491,685,756,542,043,979,776

First ten multiples9,967,656, 19,935,312, 29,902,968, 39,870,624, 49,838,280, 59,805,936, 69,773,592, 79,741,248, 89,708,904, 99,676,560

Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 1

Divisible by 6Yes

Divisible by 7No, remainder 6

Divisible by 8Yes

Divisible by 9No, remainder 3

Divisible by 10No, remainder 6

Divisible by 11No, remainder 6

Divisible by 12Yes

Divisible by 100No, remainder 56

Collatz (3n + 1) trajectory

Steps to reach 1114the total stopping time

Highest value reached9,967,656

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps9,967,656 → 4,983,828 → 2,491,914 → 1,245,957 → 3,737,872 → 1,868,936 → 934,468 → 467,234 → 233,617 → 700,852 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage996,765,600%

9,967,656% as a decimal99,676.56

9,967,656% of 1009,967,656

9,967,656% of 1,00099,676,560

As a fraction of 1009,967,656/100

Read another way

As seconds115 days, 8 hours and 47 minutes

As bytes9.506 MiB

As a 24-bit colour#981828

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.