Recognised as Number
1,665,266
- Positive
- Even
- Composite
- 7 digits
1,665,266 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,665,266
Digit count7
Digit sum32
Digit product12,960
Multiplicative persistence2times 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 × 832,633
Distinct prime factors22, 832,633
Number of divisors4
Sum of divisors σ(n)2,497,902
Aliquot sum832,636sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)832,632integers below n that share no factor with it
Carmichael function λ(n)832,632the 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, 832,633, 1,665,2664 in total
Arithmetic
Previous number1,665,265
Next number1,665,267
Double3,330,532
Half832,633
Square2,773,110,850,756
Cube4,617,967,213,995,041,096
Square root1,290.451858846≈irrational, shown to 9 decimal places
Cube root118.529887362≈
Negation-1,665,266
Reciprocal6.00504664 × 10^-7≈
Representations
Decimal1,665,266
Binary11001011010001111001021 bits
Octal6264362
Hexadecimal1968F2
Base 36ZOXE
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and sixty-five thousand, two hundred and sixty-six
Ordinalone million, six hundred and sixty-five thousand, two hundred and sixty-sixth
Scientific notation1.665266 × 10^6
Engineering notation1.665266 × 10^6
In other bases
Ternary10010121022112base 3; the most digit-efficient integer base after e: 14 digits
Quinary411242031base 5; one hand: 9 digits
Septenary20104001base 7: 8 digits
Nonary3117275base 9; each digit is two ternary digits: 7 digits
Duodecimal683842base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala8336base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:42:34:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10011TT1100TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101011100100110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110010110100011110010
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
Bytes319 68 f2
Gray code101011101110010001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110010110100011110010
64-bit0000000000000000000000000000000000000000000110010110100011110010
One's complement11111111111001101001011100001101at 32 bits, every bit flipped
Bits reversed01001111000101101001100000000000at 32 bits
Rotated left by 100000000001100101101000111100100at 32 bits, wrapping
Shifted left by 11100101101000111100100= 3,330,532, no wrap
Shifted right by 111001011010001111001= 832,633, discarding the low bit
These bits as a double8.22750722 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,665,266 to the power 22,773,110,850,756
1,665,266 to the power 34,617,967,213,995,041,096
1,665,266 to the power 47,690,143,790,580,666,105,771,536
1,665,266 to the power 512,806,134,989,565,103,523,293,742,668,576
First ten multiples1,665,266, 3,330,532, 4,995,798, 6,661,064, 8,326,330, 9,991,596, 11,656,862, 13,322,128, 14,987,394, 16,652,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 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 5
Divisible by 10No, remainder 6
Divisible by 11No, remainder 9
Divisible by 12No, remainder 2
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 1163the total stopping time
Highest value reached4,742,1162× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,665,266 → 832,633 → 2,497,900 → 1,248,950 → 624,475 → 1,873,426 → 936,713 → 2,810,140 → 1,405,070 → 702,535 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage166,526,600%
1,665,266% as a decimal16,652.66
1,665,266% of 1001,665,266
1,665,266% of 1,00016,652,660
As a fraction of 1001,665,266/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,665,266
Nerdulate something else
Nothing in mind? Surprise me · today’s page