Recognised as Number
1,000,668
- Positive
- Even
- Composite
- 7 digits
1,000,668 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,000,668
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^2 × 3 × 83,389
Distinct prime factors32, 3, 83,389
Number of divisors12
Sum of divisors σ(n)2,334,920
Aliquot sum1,334,252sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)333,552integers below n that share no factor with it
Carmichael function λ(n)83,388the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 333,552
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 12, 83,389, 166,778, 250,167, 333,556, 500,334, 1,000,66812 in total
Arithmetic
Previous number1,000,667
Next number1,000,669
Double2,001,336
Half500,334
Square1,001,336,446,224
Cube1,002,005,338,970,077,632
Square root1,000.333944241≈irrational, shown to 9 decimal places
Cube root100.02226171≈
Negation-1,000,668
Reciprocal9.99332446 × 10^-7≈
Representations
Decimal1,000,668
Binary1111010001001101110020 bits
Octal3642334
HexadecimalF44DC
Base 36LG4C
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and sixty-eight
Ordinalone million, six hundred and sixty-eighth
Scientific notation1.000668 × 10^6
Engineering notation1.000668 × 10^6
In other bases
Ternary1212211122210base 3; the most digit-efficient integer base after e: 13 digits
Quinary224010133base 5; one hand: 9 digits
Septenary11335254base 7: 8 digits
Nonary1784583base 9; each digit is two ternary digits: 7 digits
Duodecimal403110base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal651d8base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:37:57:48base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00TTT00T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100110100010100101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011110100010011011100
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 22 trailing zeros
Power of twoNo
Bytes30f 44 dc
Gray code10001110011010110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011110100010011011100
64-bit0000000000000000000000000000000000000000000011110100010011011100
One's complement11111111111100001011101100100011at 32 bits, every bit flipped
Bits reversed00111011001000101111000000000000at 32 bits
Rotated left by 100000000000111101000100110111000at 32 bits, wrapping
Shifted left by 1111101000100110111000= 2,001,336, no wrap
Shifted right by 11111010001001101110= 500,334, discarding the low bit
These bits as a double4.94395682 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,000,668 to the power 21,001,336,446,224
1,000,668 to the power 31,002,005,338,970,077,632
1,000,668 to the power 41,002,674,678,536,509,643,858,176
1,000,668 to the power 51,003,344,465,221,772,032,300,273,261,568
First ten multiples1,000,668, 2,001,336, 3,002,004, 4,002,672, 5,003,340, 6,004,008, 7,004,676, 8,005,344, 9,006,012, 10,006,680
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 3
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 3
Divisible by 10No, remainder 8
Divisible by 11No, remainder 9
Divisible by 12Yes
Divisible by 100No, remainder 68
Collatz (3n + 1) trajectory
Steps to reach 1152the total stopping time
Highest value reached1,688,6321× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,000,668 → 500,334 → 250,167 → 750,502 → 375,251 → 1,125,754 → 562,877 → 1,688,632 → 844,316 → 422,158 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage100,066,800%
1,000,668% as a decimal10,006.68
1,000,668% of 1001,000,668
1,000,668% of 1,00010,006,680
As a fraction of 1001,000,668/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,000,668
Nerdulate something else
Nothing in mind? Surprise me · today’s page