Recognised as Number
1,006,366
- Positive
- Even
- Composite
- 7 digits
1,006,366 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,006,366
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 17 × 29,599
Distinct prime factors32, 17, 29,599
Number of divisors8
Sum of divisors σ(n)1,598,400
Aliquot sum592,034sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)473,568integers below n that share no factor with it
Carmichael function λ(n)236,784the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 473,568
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 17, 34, 29,599, 59,198, 503,183, 1,006,3668 in total
Arithmetic
Previous number1,006,365
Next number1,006,367
Double2,012,732
Half503,183
Square1,012,772,525,956
Cube1,019,219,835,856,235,896
Square root1,003.177950316≈irrational, shown to 9 decimal places
Cube root100.211751297≈
Negation-1,006,366
Reciprocal9.9367427 × 10^-7≈
Representations
Decimal1,006,366
Binary1111010110110001111020 bits
Octal3655436
HexadecimalF5B1E
Base 36LKIM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six thousand, three hundred and sixty-six
Ordinalone million, six thousand, three hundred and sixty-sixth
Scientific notation1.006366 × 10^6
Engineering notation1.006366 × 10^6
In other bases
Ternary1220010110211base 3; the most digit-efficient integer base after e: 13 digits
Quinary224200431base 5; one hand: 9 digits
Septenary11361004base 7: 8 digits
Nonary1803424base 9; each digit is two ternary digits: 7 digits
Duodecimal40647abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal65fi6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:39:32:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T0010111T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001010111101100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011110101101100011110
Bit length20 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits7within that length
Bit parityodd13 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 1e
Gray code10001111011010010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011110101101100011110
64-bit0000000000000000000000000000000000000000000011110101101100011110
One's complement11111111111100001010010011100001at 32 bits, every bit flipped
Bits reversed01111000110110101111000000000000at 32 bits
Rotated left by 100000000000111101011011000111100at 32 bits, wrapping
Shifted left by 1111101011011000111100= 2,012,732, no wrap
Shifted right by 11111010110110001111= 503,183, discarding the low bit
These bits as a double4.97210868 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,006,366 to the power 21,012,772,525,956
1,006,366 to the power 31,019,219,835,856,235,896
1,006,366 to the power 41,025,708,189,331,296,693,713,936
1,006,366 to the power 51,032,237,847,664,579,728,466,118,916,576
First ten multiples1,006,366, 2,012,732, 3,019,098, 4,025,464, 5,031,830, 6,038,196, 7,044,562, 8,050,928, 9,057,294, 10,063,660
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11No, remainder 9
Divisible by 12No, remainder 10
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 190the total stopping time
Highest value reached5,094,7365× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,006,366 → 503,183 → 1,509,550 → 754,775 → 2,264,326 → 1,132,163 → 3,396,490 → 1,698,245 → 5,094,736 → 2,547,368 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage100,636,600%
1,006,366% as a decimal10,063.66
1,006,366% of 1001,006,366
1,006,366% of 1,00010,063,660
As a fraction of 1001,006,366/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,006,366
Nerdulate something else
Nothing in mind? Surprise me · today’s page