Recognised as Number
1,026,626
- Positive
- Even
- Composite
- 7 digits
1,026,626 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,026,626
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 513,313
Distinct prime factors22, 513,313
Number of divisors4
Sum of divisors σ(n)1,539,942
Aliquot sum513,316sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)513,312integers below n that share no factor with it
Carmichael function λ(n)513,312the 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, 513,313, 1,026,6264 in total
Arithmetic
Previous number1,026,625
Next number1,026,627
Double2,053,252
Half513,313
Square1,053,960,943,876
Cube1,082,023,707,967,642,376
Square root1,013.225542513≈irrational, shown to 9 decimal places
Cube root100.879770671≈
Negation-1,026,626
Reciprocal9.74064557 × 10^-7≈
Representations
Decimal1,026,626
Binary1111101010100100001020 bits
Octal3725102
HexadecimalFAA42
Base 36M05E
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, twenty-six thousand, six hundred and twenty-six
Ordinalone million, twenty-six thousand, six hundred and twenty-sixth
Scientific notation1.026626 × 10^6
Engineering notation1.026626 × 10^6
In other bases
Ternary1221011021012base 3; the most digit-efficient integer base after e: 13 digits
Quinary230323001base 5; one hand: 9 digits
Septenary11504036base 7: 8 digits
Nonary1834235base 9; each digit is two ternary digits: 7 digits
Duodecimal416142base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal686b6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:45:10:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T10111T11TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001111111001000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111010101001000010
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 11 trailing zero
Power of twoNo
Bytes30f aa 42
Gray code10000111111101100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111010101001000010
64-bit0000000000000000000000000000000000000000000011111010101001000010
One's complement11111111111100000101010110111101at 32 bits, every bit flipped
Bits reversed01000010010101011111000000000000at 32 bits
Rotated left by 100000000000111110101010010000100at 32 bits, wrapping
Shifted left by 1111110101010010000100= 2,053,252, no wrap
Shifted right by 11111101010100100001= 513,313, discarding the low bit
These bits as a double5.07220638 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,026,626 to the power 21,053,960,943,876
1,026,626 to the power 31,082,023,707,967,642,376
1,026,626 to the power 41,110,833,671,215,988,821,903,376
1,026,626 to the power 51,140,410,728,545,785,740,275,375,289,376
First ten multiples1,026,626, 2,053,252, 3,079,878, 4,106,504, 5,133,130, 6,159,756, 7,186,382, 8,213,008, 9,239,634, 10,266,260
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
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 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 5
Divisible by 10No, remainder 6
Divisible by 11No, remainder 7
Divisible by 12No, remainder 2
Divisible by 100No, remainder 26
Collatz (3n + 1) trajectory
Steps to reach 1165the total stopping time
Highest value reached1,539,9401× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,026,626 → 513,313 → 1,539,940 → 769,970 → 384,985 → 1,154,956 → 577,478 → 288,739 → 866,218 → 433,109 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage102,662,600%
1,026,626% as a decimal10,266.26
1,026,626% of 1001,026,626
1,026,626% of 1,00010,266,260
As a fraction of 1001,026,626/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,026,626
Nerdulate something else
Nothing in mind? Surprise me · today’s page