Recognised as Number

1,045,604

Positive
Even
Composite
7 digits

1,045,604 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,045,604

Digit count7

Digit sum20

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 7 × 107 × 349

Distinct prime factors42, 7, 107, 349

Number of divisors24

Sum of divisors σ(n)2,116,800

Aliquot sum1,071,196sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)18,444the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 442,656

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 7, 14, 28, 107, 214, 349, 428, 698, 749, 1,396, 1,498, 2,443, 2,996, 4,886, 9,772, 37,343, 74,686, 149,372, 261,401, 522,802, 1,045,60424 in total

Arithmetic

Previous number1,045,603

Next number1,045,605

Double2,091,208

Half522,802

Square1,093,287,724,816

Cube1,143,146,018,218,508,864

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

Cube root101.497593511≈

Negation-1,045,604

Reciprocal9.56385018 × 10^-7≈

Representations

Decimal1,045,604

Binary1111111101000110010020 bits

Octal3772144

HexadecimalFF464

Base 36MESK

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

In wordsone million, forty-five thousand, six hundred and four

Ordinalone million, forty-five thousand, six hundred and fourth

Scientific notation1.045604 × 10^6

Engineering notation1.045604 × 10^6

In other bases

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

Quinary231424404base 5; one hand: 9 digits

Septenary11613260base 7: 8 digits

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

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

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

Sexagesimal4:50:26:44base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000011111111010001100100

Bit length20 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 19worth 524,288

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes30f f4 64

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

At each machine width

32-bit00000000000011111111010001100100

64-bit0000000000000000000000000000000000000000000011111111010001100100

One's complement11111111111100000000101110011011at 32 bits, every bit flipped

Bits reversed00100110001011111111000000000000at 32 bits

Rotated left by 100000000000111111110100011001000at 32 bits, wrapping

Shifted left by 1111111110100011001000= 2,091,208, no wrap

Shifted right by 11111111101000110010= 522,802, discarding the low bit

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

Nearest landmarks

Next prime1,045,607+3

Previous prime1,045,573−31

Distance to nearest prime3

Nearest square below1,044,484

Nearest square above1,046,529

Powers & multiples

1,045,604 to the power 21,093,287,724,816

1,045,604 to the power 31,143,146,018,218,508,864

1,045,604 to the power 41,195,278,049,233,345,742,233,856

1,045,604 to the power 51,249,787,509,390,583,241,462,688,769,024

First ten multiples1,045,604, 2,091,208, 3,136,812, 4,182,416, 5,228,020, 6,273,624, 7,319,228, 8,364,832, 9,410,436, 10,456,040

Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6No, remainder 2

Divisible by 7Yes

Divisible by 8No, remainder 4

Divisible by 9No, remainder 2

Divisible by 10No, remainder 4

Divisible by 11No, remainder 10

Divisible by 12No, remainder 8

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 1165the total stopping time

Highest value reached1,045,604

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

First steps1,045,604 → 522,802 → 261,401 → 784,204 → 392,102 → 196,051 → 588,154 → 294,077 → 882,232 → 441,116 → …

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

As a percentage & fraction

As a percentage104,560,400%

1,045,604% as a decimal10,456.04

1,045,604% of 1001,045,604

1,045,604% of 1,00010,456,040

As a fraction of 1001,045,604/100

Read another way

As seconds12 days, 2 hours and 26 minutes

As bytes1,021.098 KiB

As a 24-bit colour#0FF464

Keep nerding

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