Recognised as Number

9,563,104

Positive
Even
Composite
7 digits

9,563,104 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value9,563,104

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^5 × 298,847

Distinct prime factors22, 298,847

Number of divisors12

Sum of divisors σ(n)18,827,424

Aliquot sum9,264,320sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)4,781,536integers below n that share no factor with it

Carmichael function λ(n)1,195,384the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,781,536

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 32, 298,847, 597,694, 1,195,388, 2,390,776, 4,781,552, 9,563,10412 in total

Arithmetic

Previous number9,563,103

Next number9,563,105

Double19,126,208

Half4,781,552

Square91,452,958,114,816

Cube874,574,149,559,629,348,864

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

Cube root212.259087533≈

Negation-9,563,104

Reciprocal1.04568558 × 10^-7≈

Representations

Decimal9,563,104

Binary10010001111010111110000024 bits

Octal44365740

Hexadecimal91EBE0

Base 365OYXS

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

In wordsnine million, five hundred and sixty-three thousand, one hundred and four

Ordinalnine million, five hundred and sixty-three thousand, one hundred and fourth

Scientific notation9.563104 × 10^6

Engineering notation9.563104 × 10^6

In other bases

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

Quinary4422004404base 5; one hand: 10 digits

Septenary144166525base 7: 9 digits

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

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

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

Sexagesimal44:16:25:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000100100011110101111100000

Bit length24 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits12within that length

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

Highest set bitbit 23worth 8,388,608

Lowest set bitbit 55 trailing zeros

Power of twoNo

Bytes391 eb e0

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

At each machine width

32-bit00000000100100011110101111100000

64-bit0000000000000000000000000000000000000000100100011110101111100000

One's complement11111111011011100001010000011111at 32 bits, every bit flipped

Bits reversed00000111110101111000100100000000at 32 bits

Rotated left by 100000001001000111101011111000000at 32 bits, wrapping

Shifted left by 11001000111101011111000000= 19,126,208, no wrap

Shifted right by 110010001111010111110000= 4,781,552, discarding the low bit

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

Nearest landmarks

Next prime9,563,117+13

Previous prime9,563,093−11

Distance to nearest prime11

Nearest square below9,560,464

Nearest square above9,566,649

Powers & multiples

9,563,104 to the power 291,452,958,114,816

9,563,104 to the power 3874,574,149,559,629,348,864

9,563,104 to the power 48,363,643,547,950,289,664,638,713,856

9,563,104 to the power 579,982,393,067,977,606,893,065,143,031,169,024

First ten multiples9,563,104, 19,126,208, 28,689,312, 38,252,416, 47,815,520, 57,378,624, 66,941,728, 76,504,832, 86,067,936, 95,631,040

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 5

Divisible by 8Yes

Divisible by 9No, remainder 1

Divisible by 10No, remainder 4

Divisible by 11No, remainder 1

Divisible by 12No, remainder 4

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time

Highest value reached9,563,104

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

First steps9,563,104 → 4,781,552 → 2,390,776 → 1,195,388 → 597,694 → 298,847 → 896,542 → 448,271 → 1,344,814 → 672,407 → …

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

As a percentage & fraction

As a percentage956,310,400%

9,563,104% as a decimal95,631.04

9,563,104% of 1009,563,104

9,563,104% of 1,00095,631,040

As a fraction of 1009,563,104/100

Read another way

As seconds110 days, 16 hours and 25 minutes

As bytes9.12 MiB

As a 24-bit colour#91EBE0

Keep nerding

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