Recognised as Number
1,067,386
- Positive
- Even
- Composite
- 7 digits
1,067,386 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,067,386
Digit count7
Digit sum31
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 × 533,693
Distinct prime factors22, 533,693
Number of divisors4
Sum of divisors σ(n)1,601,082
Aliquot sum533,696sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)533,692integers below n that share no factor with it
Carmichael function λ(n)533,692the 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, 533,693, 1,067,3864 in total
Arithmetic
Previous number1,067,385
Next number1,067,387
Double2,134,772
Half533,693
Square1,139,312,872,996
Cube1,216,086,610,255,708,456
Square root1,033.143746049≈irrational, shown to 9 decimal places
Cube root102.197553821≈
Negation-1,067,386
Reciprocal9.368682 × 10^-7≈
Representations
Decimal1,067,386
Binary10000010010010111101021 bits
Octal4044572
Hexadecimal10497A
Base 36MVLM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, sixty-seven thousand, three hundred and eighty-six
Ordinalone million, sixty-seven thousand, three hundred and eighty-sixth
Scientific notation1.067386 × 10^6
Engineering notation1.067386 × 10^6
In other bases
Ternary2000020011211base 3; the most digit-efficient integer base after e: 13 digits
Quinary233124021base 5; one hand: 9 digits
Septenary12033625base 7: 8 digits
Nonary2006154base 9; each digit is two ternary digits: 7 digits
Duodecimal43584abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6d896base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:56:29:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0001T01TTT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000101111010001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000100100101111010
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes310 49 7a
Gray code110000110110111000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000100100101111010
64-bit0000000000000000000000000000000000000000000100000100100101111010
One's complement11111111111011111011011010000101at 32 bits, every bit flipped
Bits reversed01011110100100100000100000000000at 32 bits
Rotated left by 100000000001000001001001011110100at 32 bits, wrapping
Shifted left by 11000001001001011110100= 2,134,772, no wrap
Shifted right by 110000010010010111101= 533,693, discarding the low bit
These bits as a double5.27358753 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,067,386 to the power 21,139,312,872,996
1,067,386 to the power 31,216,086,610,255,708,456
1,067,386 to the power 41,298,033,822,574,399,626,016,016
1,067,386 to the power 51,385,503,129,742,398,119,214,731,254,176
First ten multiples1,067,386, 2,134,772, 3,202,158, 4,269,544, 5,336,930, 6,404,316, 7,471,702, 8,539,088, 9,606,474, 10,673,860
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 5
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11No, remainder 1
Divisible by 12No, remainder 10
Divisible by 100No, remainder 86
Collatz (3n + 1) trajectory
Steps to reach 1121the total stopping time
Highest value reached1,601,0801× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,067,386 → 533,693 → 1,601,080 → 800,540 → 400,270 → 200,135 → 600,406 → 300,203 → 900,610 → 450,305 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage106,738,600%
1,067,386% as a decimal10,673.86
1,067,386% of 1001,067,386
1,067,386% of 1,00010,673,860
As a fraction of 1001,067,386/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,067,386
Nerdulate something else
Nothing in mind? Surprise me · today’s page