Recognised as Number

1,061,660

Positive
Even
Composite
7 digits

1,061,660 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,061,660

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 numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 5 × 109 × 487

Distinct prime factors42, 5, 109, 487

Number of divisors24

Sum of divisors σ(n)2,254,560

Aliquot sum1,192,900sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)972the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 419,904

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 10, 20, 109, 218, 436, 487, 545, 974, 1,090, 1,948, 2,180, 2,435, 4,870, 9,740, 53,083, 106,166, 212,332, 265,415, 530,830, 1,061,66024 in total

Arithmetic

Previous number1,061,659

Next number1,061,661

Double2,123,320

Half530,830

Square1,127,121,955,600

Cube1,196,620,295,382,296,000

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

Cube root102.014479554≈

Negation-1,061,660

Reciprocal9.41921142 × 10^-7≈

Representations

Decimal1,061,660

Binary10000001100110001110021 bits

Octal4031434

Hexadecimal10331C

Base 36MR6K

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

In wordsone million, sixty-one thousand, six hundred and sixty

Ordinalone million, sixty-one thousand, six hundred and sixtieth

Scientific notation1.06166 × 10^6

Engineering notation1.06166 × 10^6

In other bases

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

Quinary232433120base 5; one hand: 9 digits

Septenary12011135base 7: 8 digits

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

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

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

Sexagesimal4:54:54:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100000011001100011100

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

Bit parityeven8 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 33 1c

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

At each machine width

32-bit00000000000100000011001100011100

64-bit0000000000000000000000000000000000000000000100000011001100011100

One's complement11111111111011111100110011100011at 32 bits, every bit flipped

Bits reversed00111000110011000000100000000000at 32 bits

Rotated left by 100000000001000000110011000111000at 32 bits, wrapping

Shifted left by 11000000110011000111000= 2,123,320, no wrap

Shifted right by 110000001100110001110= 530,830, discarding the low bit

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

Nearest landmarks

Next prime1,061,677+17

Previous prime1,061,651−9

Distance to nearest prime9

Nearest square below1,060,900

Nearest square above1,062,961

Powers & multiples

1,061,660 to the power 21,127,121,955,600

1,061,660 to the power 31,196,620,295,382,296,000

1,061,660 to the power 41,270,403,902,795,568,371,360,000

1,061,660 to the power 51,348,737,007,441,943,117,138,057,600,000

First ten multiples1,061,660, 2,123,320, 3,184,980, 4,246,640, 5,308,300, 6,369,960, 7,431,620, 8,493,280, 9,554,940, 10,616,600

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 5

Divisible by 8No, remainder 4

Divisible by 9No, remainder 2

Divisible by 10Yes

Divisible by 11No, remainder 6

Divisible by 12No, remainder 8

Divisible by 100No, remainder 60

Collatz (3n + 1) trajectory

Steps to reach 1134the total stopping time

Highest value reached1,791,5561× the starting value

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

First steps1,061,660 → 530,830 → 265,415 → 796,246 → 398,123 → 1,194,370 → 597,185 → 1,791,556 → 895,778 → 447,889 → …

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

As a percentage & fraction

As a percentage106,166,000%

1,061,660% as a decimal10,616.6

1,061,660% of 1001,061,660

1,061,660% of 1,00010,616,600

As a fraction of 1001,061,660/100

Read another way

As seconds12 days, 6 hours and 54 minutes

As bytes1.012 MiB

As a 24-bit colour#10331C

Keep nerding

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