Recognised as Number
1,064,366
- Positive
- Even
- Composite
- 7 digits
1,064,366 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,064,366
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 532,183
Distinct prime factors22, 532,183
Number of divisors4
Sum of divisors σ(n)1,596,552
Aliquot sum532,186sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)532,182integers below n that share no factor with it
Carmichael function λ(n)532,182the 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, 532,183, 1,064,3664 in total
Arithmetic
Previous number1,064,365
Next number1,064,367
Double2,128,732
Half532,183
Square1,132,874,981,956
Cube1,205,793,613,044,579,896
Square root1,031.681152295≈irrational, shown to 9 decimal places
Cube root102.101078835≈
Negation-1,064,366
Reciprocal9.39526441 × 10^-7≈
Representations
Decimal1,064,366
Binary10000001111011010111021 bits
Octal4036656
Hexadecimal103DAE
Base 36MT9Q
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, sixty-four thousand, three hundred and sixty-six
Ordinalone million, sixty-four thousand, three hundred and sixty-sixth
Scientific notation1.064366 × 10^6
Engineering notation1.064366 × 10^6
In other bases
Ternary2000002000222base 3; the most digit-efficient integer base after e: 13 digits
Quinary233024431base 5; one hand: 9 digits
Septenary12022052base 7: 8 digits
Nonary2002028base 9; each digit is two ternary digits: 7 digits
Duodecimal433b52base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6d0i6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:55:39:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00001T00100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000100001011110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000011110110101110
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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 3d ae
Gray code110000010001101111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000011110110101110
64-bit0000000000000000000000000000000000000000000100000011110110101110
One's complement11111111111011111100001001010001at 32 bits, every bit flipped
Bits reversed01110101101111000000100000000000at 32 bits
Rotated left by 100000000001000000111101101011100at 32 bits, wrapping
Shifted left by 11000000111101101011100= 2,128,732, no wrap
Shifted right by 110000001111011010111= 532,183, discarding the low bit
These bits as a double5.25866675 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,064,366 to the power 21,132,874,981,956
1,064,366 to the power 31,205,793,613,044,579,896
1,064,366 to the power 41,283,405,724,741,807,325,585,936
1,064,366 to the power 51,366,013,417,620,538,495,904,600,356,576
First ten multiples1,064,366, 2,128,732, 3,193,098, 4,257,464, 5,321,830, 6,386,196, 7,450,562, 8,514,928, 9,579,294, 10,643,660
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached3,592,2403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,064,366 → 532,183 → 1,596,550 → 798,275 → 2,394,826 → 1,197,413 → 3,592,240 → 1,796,120 → 898,060 → 449,030 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage106,436,600%
1,064,366% as a decimal10,643.66
1,064,366% of 1001,064,366
1,064,366% of 1,00010,643,660
As a fraction of 1001,064,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,064,366
Nerdulate something else
Nothing in mind? Surprise me · today’s page