Recognised as Number

1,109,604

Positive
Even
Composite
7 digits

1,109,604 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,109,604

Digit count7

Digit sum21

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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^2 × 3 × 92,467

Distinct prime factors32, 3, 92,467

Number of divisors12

Sum of divisors σ(n)2,589,104

Aliquot sum1,479,500sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)369,864integers below n that share no factor with it

Carmichael function λ(n)92,466the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 369,864

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 12, 92,467, 184,934, 277,401, 369,868, 554,802, 1,109,60412 in total

Arithmetic

Previous number1,109,603

Next number1,109,605

Double2,219,208

Half554,802

Square1,231,221,036,816

Cube1,366,167,787,335,180,864

Square root1,053.377425238≈irrational, shown to 9 decimal places

Cube root103.52756623≈

Negation-1,109,604

Reciprocal9.01222418 × 10^-7≈

Representations

Decimal1,109,604

Binary10000111011100110010021 bits

Octal4167144

Hexadecimal10EE64

Base 36NS6C

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

In wordsone million, one hundred and nine thousand, six hundred and four

Ordinalone million, one hundred and nine thousand, six hundred and fourth

Scientific notation1.109604 × 10^6

Engineering notation1.109604 × 10^6

In other bases

Ternary2002101002110base 3; the most digit-efficient integer base after e: 13 digits

Quinary241001404base 5; one hand: 9 digits

Septenary12300666base 7: 8 digits

Nonary2071073base 9; each digit is two ternary digits: 7 digits

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

Vigesimal6ie04base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:8:13:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100001110111001100100

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes310 ee 64

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

At each machine width

32-bit00000000000100001110111001100100

64-bit0000000000000000000000000000000000000000000100001110111001100100

One's complement11111111111011110001000110011011at 32 bits, every bit flipped

Bits reversed00100110011101110000100000000000at 32 bits

Rotated left by 100000000001000011101110011001000at 32 bits, wrapping

Shifted left by 11000011101110011001000= 2,219,208, no wrap

Shifted right by 110000111011100110010= 554,802, discarding the low bit

These bits as a double5.48217217 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,109,609+5

Previous prime1,109,579−25

Distance to nearest prime5

Nearest square below1,108,809

Nearest square above1,110,916

Powers & multiples

1,109,604 to the power 21,231,221,036,816

1,109,604 to the power 31,366,167,787,335,180,864

1,109,604 to the power 41,515,905,241,498,266,027,417,856

1,109,604 to the power 51,682,054,519,587,441,977,086,962,689,024

First ten multiples1,109,604, 2,219,208, 3,328,812, 4,438,416, 5,548,020, 6,657,624, 7,767,228, 8,876,832, 9,986,436, 11,096,040

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 6

Divisible by 8No, remainder 4

Divisible by 9No, remainder 3

Divisible by 10No, remainder 4

Divisible by 11No, remainder 1

Divisible by 12Yes

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 1284the total stopping time

Highest value reached1,109,604

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

First steps1,109,604 → 554,802 → 277,401 → 832,204 → 416,102 → 208,051 → 624,154 → 312,077 → 936,232 → 468,116 → …

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

As a percentage & fraction

As a percentage110,960,400%

1,109,604% as a decimal11,096.04

1,109,604% of 1001,109,604

1,109,604% of 1,00011,096,040

As a fraction of 1001,109,604/100

Read another way

As seconds12 days, 20 hours and 13 minutes

As bytes1.058 MiB

As a 24-bit colour#10EE64

Keep nerding

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