Recognised as Number

1,009,770

Positive
Even
Composite
7 digits

1,009,770 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,009,770

Digit count7

Digit sum24

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 5 × 97 × 347

Distinct prime factors52, 3, 5, 97, 347

Number of divisors32

Sum of divisors σ(n)2,455,488

Aliquot sum1,445,718sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)16,608the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 265,728

Möbius function μ(n)−15 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 5, 6, 10, 15, 30, 97, 194, 291, 347, 485, 582, 694, 970, 1,041, 1,455, 1,735, 2,082, 2,910, 3,470, 5,205, 10,410, 33,659, 67,318, 100,977, 168,295, 201,954, 336,590, 504,885, 1,009,77032 in total

Arithmetic

Previous number1,009,769

Next number1,009,771

Double2,019,540

Half504,885

Square1,019,635,452,900

Cube1,029,597,291,274,833,000

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

Cube root100.324611798≈

Negation-1,009,770

Reciprocal9.90324529 × 10^-7≈

Representations

Decimal1,009,770

Binary1111011010000110101020 bits

Octal3664152

HexadecimalF686A

Base 36LN56

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

In wordsone million, nine thousand, seven hundred and seventy

Ordinalone million, nine thousand, seven hundred and seventieth

Scientific notation1.00977 × 10^6

Engineering notation1.00977 × 10^6

In other bases

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

Quinary224303040base 5; one hand: 9 digits

Septenary11403636base 7: 8 digits

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

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

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

Sexagesimal4:40:29:30base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000011110110100001101010

Bit length20 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 19worth 524,288

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes30f 68 6a

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

At each machine width

32-bit00000000000011110110100001101010

64-bit0000000000000000000000000000000000000000000011110110100001101010

One's complement11111111111100001001011110010101at 32 bits, every bit flipped

Bits reversed01010110000101101111000000000000at 32 bits

Rotated left by 100000000000111101101000011010100at 32 bits, wrapping

Shifted left by 1111101101000011010100= 2,019,540, no wrap

Shifted right by 11111011010000110101= 504,885, discarding the low bit

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

Nearest landmarks

Next prime1,009,781+11

Previous prime1,009,747−23

Distance to nearest prime11

Nearest square below1,008,016

Nearest square above1,010,025

Powers & multiples

1,009,770 to the power 21,019,635,452,900

1,009,770 to the power 31,029,597,291,274,833,000

1,009,770 to the power 41,039,656,456,810,588,118,410,000

1,009,770 to the power 51,049,813,900,393,627,564,326,865,700,000

First ten multiples1,009,770, 2,019,540, 3,029,310, 4,039,080, 5,048,850, 6,058,620, 7,068,390, 8,078,160, 9,087,930, 10,097,700

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6Yes

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 6

Divisible by 10Yes

Divisible by 11No, remainder 3

Divisible by 12No, remainder 6

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1108the total stopping time

Highest value reached1,514,6561× the starting value

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

First steps1,009,770 → 504,885 → 1,514,656 → 757,328 → 378,664 → 189,332 → 94,666 → 47,333 → 142,000 → 71,000 → …

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

As a percentage & fraction

As a percentage100,977,000%

1,009,770% as a decimal10,097.7

1,009,770% of 1001,009,770

1,009,770% of 1,00010,097,700

As a fraction of 1001,009,770/100

Read another way

As seconds11 days, 16 hours and 29 minutes

As bytes986.104 KiB

As a 24-bit colour#0F686A

Keep nerding

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