Recognised as Number

1,006,466

Positive
Even
Composite
7 digits

1,006,466 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,006,466

Digit count7

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 503,233

Distinct prime factors22, 503,233

Number of divisors4

Sum of divisors σ(n)1,509,702

Aliquot sum503,236sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)503,232the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 503,233, 1,006,4664 in total

Arithmetic

Previous number1,006,465

Next number1,006,467

Double2,012,932

Half503,233

Square1,012,973,809,156

Cube1,019,523,697,806,002,696

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

Cube root100.215070449≈

Negation-1,006,466

Reciprocal9.93575541 × 10^-7≈

Representations

Decimal1,006,466

Binary1111010110111000001020 bits

Octal3655602

HexadecimalF5B82

Base 36LKLE

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

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

Ordinalone million, six thousand, four hundred and sixty-sixth

Scientific notation1.006466 × 10^6

Engineering notation1.006466 × 10^6

In other bases

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

Quinary224201331base 5; one hand: 9 digits

Septenary11361206base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000011110101101110000010

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 5b 82

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

At each machine width

32-bit00000000000011110101101110000010

64-bit0000000000000000000000000000000000000000000011110101101110000010

One's complement11111111111100001010010001111101at 32 bits, every bit flipped

Bits reversed01000001110110101111000000000000at 32 bits

Rotated left by 100000000000111101011011100000100at 32 bits, wrapping

Shifted left by 1111101011011100000100= 2,012,932, no wrap

Shifted right by 11111010110111000001= 503,233, discarding the low bit

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

Nearest landmarks

Next prime1,006,469+3

Previous prime1,006,463−3

Distance to nearest prime3

Nearest square below1,006,009

Nearest square above1,008,016

Powers & multiples

1,006,466 to the power 21,012,973,809,156

1,006,466 to the power 31,019,523,697,806,002,696

1,006,466 to the power 41,026,115,938,036,016,309,432,336

1,006,466 to the power 51,032,750,803,691,357,190,889,125,484,576

First ten multiples1,006,466, 2,012,932, 3,019,398, 4,025,864, 5,032,330, 6,038,796, 7,045,262, 8,051,728, 9,058,194, 10,064,660

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

Divisible by 5No, remainder 1

Divisible by 6No, remainder 2

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10No, remainder 6

Divisible by 11No, remainder 10

Divisible by 12No, remainder 2

Divisible by 100No, remainder 66

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time

Highest value reached1,509,7001× the starting value

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

First steps1,006,466 → 503,233 → 1,509,700 → 754,850 → 377,425 → 1,132,276 → 566,138 → 283,069 → 849,208 → 424,604 → …

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

As a percentage & fraction

As a percentage100,646,600%

1,006,466% as a decimal10,064.66

1,006,466% of 1001,006,466

1,006,466% of 1,00010,064,660

As a fraction of 1001,006,466/100

Read another way

As seconds11 days, 15 hours and 34 minutes

As bytes982.877 KiB

As a 24-bit colour#0F5B82

Keep nerding

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