Recognised as Number

1,006,464

Positive
Even
Composite
7 digits

1,006,464 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,006,464

Digit count7

Digit sum21

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^7 × 3 × 2,621

Distinct prime factors32, 3, 2,621

Number of divisors32

Sum of divisors σ(n)2,674,440

Aliquot sum1,667,976sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 64, 96, 128, 192, 384, 2,621, 5,242, 7,863, 10,484, 15,726, 20,968, 31,452, 41,936, 62,904, 83,872, 125,808, 167,744, 251,616, 335,488, 503,232, 1,006,46432 in total

Arithmetic

Previous number1,006,463

Next number1,006,465

Double2,012,928

Half503,232

Square1,012,969,783,296

Cube1,019,517,619,975,225,344

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

Cube root100.215004068≈

Negation-1,006,464

Reciprocal9.93577515 × 10^-7≈

Representations

Decimal1,006,464

Binary1111010110111000000020 bits

Octal3655600

HexadecimalF5B80

Base 36LKLC

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

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

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

Scientific notation1.006464 × 10^6

Engineering notation1.006464 × 10^6

In other bases

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

Quinary224201324base 5; one hand: 9 digits

Septenary11361204base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000011110101101110000000

Bit length20 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits10within that length

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

Highest set bitbit 19worth 524,288

Lowest set bitbit 77 trailing zeros

Power of twoNo

Bytes30f 5b 80

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

At each machine width

32-bit00000000000011110101101110000000

64-bit0000000000000000000000000000000000000000000011110101101110000000

One's complement11111111111100001010010001111111at 32 bits, every bit flipped

Bits reversed00000001110110101111000000000000at 32 bits

Rotated left by 100000000000111101011011100000000at 32 bits, wrapping

Shifted left by 1111101011011100000000= 2,012,928, no wrap

Shifted right by 11111010110111000000= 503,232, discarding the low bit

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

Nearest landmarks

Next prime1,006,469+5

Previous prime1,006,463−1

Distance to nearest prime1

Nearest square below1,006,009

Nearest square above1,008,016

Powers & multiples

1,006,464 to the power 21,012,969,783,296

1,006,464 to the power 31,019,517,619,975,225,344

1,006,464 to the power 41,026,107,781,870,745,200,623,616

1,006,464 to the power 51,032,740,542,572,757,697,600,447,053,824

First ten multiples1,006,464, 2,012,928, 3,019,392, 4,025,856, 5,032,320, 6,038,784, 7,045,248, 8,051,712, 9,058,176, 10,064,640

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 4

Divisible by 6Yes

Divisible by 7No, remainder 4

Divisible by 8Yes

Divisible by 9No, remainder 3

Divisible by 10No, remainder 4

Divisible by 11No, remainder 8

Divisible by 12Yes

Divisible by 100No, remainder 64

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time

Highest value reached1,006,464

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

First steps1,006,464 → 503,232 → 251,616 → 125,808 → 62,904 → 31,452 → 15,726 → 7,863 → 23,590 → 11,795 → …

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

As a percentage & fraction

As a percentage100,646,400%

1,006,464% as a decimal10,064.64

1,006,464% of 1001,006,464

1,006,464% of 1,00010,064,640

As a fraction of 1001,006,464/100

Read another way

As seconds11 days, 15 hours and 34 minutes

As bytes982.875 KiB

As a 24-bit colour#0F5B80

Keep nerding

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