Recognised as Number

1,066,544

Positive
Even
Composite
7 digits

1,066,544 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,066,544

Digit count7

Digit sum26

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 191 × 349

Distinct prime factors32, 191, 349

Number of divisors20

Sum of divisors σ(n)2,083,200

Aliquot sum1,016,656sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)33,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 528,960

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 16, 191, 349, 382, 698, 764, 1,396, 1,528, 2,792, 3,056, 5,584, 66,659, 133,318, 266,636, 533,272, 1,066,54420 in total

Arithmetic

Previous number1,066,543

Next number1,066,545

Double2,133,088

Half533,272

Square1,137,516,103,936

Cube1,213,210,975,556,317,184

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

Cube root102.170674143≈

Negation-1,066,544

Reciprocal9.37607825 × 10^-7≈

Representations

Decimal1,066,544

Binary10000010001100011000021 bits

Octal4043060

Hexadecimal104630

Base 36MUY8

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

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

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

Scientific notation1.066544 × 10^6

Engineering notation1.066544 × 10^6

In other bases

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

Quinary233112134base 5; one hand: 9 digits

Septenary12031313base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100000100011000110000

Bit length21 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits15within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes310 46 30

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

At each machine width

32-bit00000000000100000100011000110000

64-bit0000000000000000000000000000000000000000000100000100011000110000

One's complement11111111111011111011100111001111at 32 bits, every bit flipped

Bits reversed00001100011000100000100000000000at 32 bits

Rotated left by 100000000001000001000110001100000at 32 bits, wrapping

Shifted left by 11000001000110001100000= 2,133,088, no wrap

Shifted right by 110000010001100011000= 533,272, discarding the low bit

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

Nearest landmarks

Next prime1,066,553+9

Previous prime1,066,531−13

Distance to nearest prime9

Nearest square below1,065,024

Nearest square above1,067,089

Powers & multiples

1,066,544 to the power 21,137,516,103,936

1,066,544 to the power 31,213,210,975,556,317,184

1,066,544 to the power 41,293,942,886,713,736,754,692,096

1,066,544 to the power 51,380,047,022,167,215,653,296,326,836,224

First ten multiples1,066,544, 2,133,088, 3,199,632, 4,266,176, 5,332,720, 6,399,264, 7,465,808, 8,532,352, 9,598,896, 10,665,440

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 5No, remainder 4

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8Yes

Divisible by 9No, remainder 8

Divisible by 10No, remainder 4

Divisible by 11No, remainder 6

Divisible by 12No, remainder 8

Divisible by 100No, remainder 44

Collatz (3n + 1) trajectory

Steps to reach 1165the total stopping time

Highest value reached1,066,544

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

First steps1,066,544 → 533,272 → 266,636 → 133,318 → 66,659 → 199,978 → 99,989 → 299,968 → 149,984 → 74,992 → …

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

As a percentage & fraction

As a percentage106,654,400%

1,066,544% as a decimal10,665.44

1,066,544% of 1001,066,544

1,066,544% of 1,00010,665,440

As a fraction of 1001,066,544/100

Read another way

As seconds12 days, 8 hours and 15 minutes

As bytes1.017 MiB

As a 24-bit colour#104630

Keep nerding

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