Recognised as Number
1,267,766
- Positive
- Even
- Composite
- 7 digits
1,267,766 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,267,766
Digit count7
Digit sum35
Digit product21,168
Multiplicative persistence5times 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 × 633,883
Distinct prime factors22, 633,883
Number of divisors4
Sum of divisors σ(n)1,901,652
Aliquot sum633,886sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)633,882integers below n that share no factor with it
Carmichael function λ(n)633,882the 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, 633,883, 1,267,7664 in total
Arithmetic
Previous number1,267,765
Next number1,267,767
Double2,535,532
Half633,883
Square1,607,230,630,756
Cube2,037,592,347,831,011,096
Square root1,125.95115347≈irrational, shown to 9 decimal places
Cube root108.229678104≈
Negation-1,267,766
Reciprocal7.88789098 × 10^-7≈
Representations
Decimal1,267,766
Binary10011010110000011011021 bits
Octal4654066
Hexadecimal135836
Base 36R67Q
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and sixty-seven thousand, seven hundred and sixty-six
Ordinalone million, two hundred and sixty-seven thousand, seven hundred and sixty-sixth
Scientific notation1.267766 × 10^6
Engineering notation1.267766 × 10^6
In other bases
Ternary2101102001022base 3; the most digit-efficient integer base after e: 13 digits
Quinary311032031base 5; one hand: 9 digits
Septenary13530053base 7: 8 digits
Nonary2342038base 9; each digit is two ternary digits: 7 digits
Duodecimal5117b2base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7i986base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:52:9:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10111T00110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001010100001001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110101100000110110
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; 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
Bytes313 58 36
Gray code110101111010000101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110101100000110110
64-bit0000000000000000000000000000000000000000000100110101100000110110
One's complement11111111111011001010011111001001at 32 bits, every bit flipped
Bits reversed01101100000110101100100000000000at 32 bits
Rotated left by 100000000001001101011000001101100at 32 bits, wrapping
Shifted left by 11001101011000001101100= 2,535,532, no wrap
Shifted right by 110011010110000011011= 633,883, discarding the low bit
These bits as a double6.26359628 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,267,766 to the power 21,607,230,630,756
1,267,766 to the power 32,037,592,347,831,011,096
1,267,766 to the power 42,583,190,300,440,329,613,131,536
1,267,766 to the power 53,274,880,834,428,034,912,321,314,868,576
First ten multiples1,267,766, 2,535,532, 3,803,298, 5,071,064, 6,338,830, 7,606,596, 8,874,362, 10,142,128, 11,409,894, 12,677,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 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12No, remainder 2
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 1155the total stopping time
Highest value reached12,184,3249× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,267,766 → 633,883 → 1,901,650 → 950,825 → 2,852,476 → 1,426,238 → 713,119 → 2,139,358 → 1,069,679 → 3,209,038 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage126,776,600%
1,267,766% as a decimal12,677.66
1,267,766% of 1001,267,766
1,267,766% of 1,00012,677,660
As a fraction of 1001,267,766/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,267,766
Nerdulate something else
Nothing in mind? Surprise me · today’s page