Recognised as Number
1,264,966
- Positive
- Even
- Composite
- 7 digits
1,264,966 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,264,966
Digit count7
Digit sum34
Digit product15,552
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 632,483
Distinct prime factors22, 632,483
Number of divisors4
Sum of divisors σ(n)1,897,452
Aliquot sum632,486sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)632,482integers below n that share no factor with it
Carmichael function λ(n)632,482the 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, 632,483, 1,264,9664 in total
Arithmetic
Previous number1,264,965
Next number1,264,967
Double2,529,932
Half632,483
Square1,600,138,981,156
Cube2,024,121,406,436,980,696
Square root1,124.707072975≈irrational, shown to 9 decimal places
Cube root108.149940341≈
Negation-1,264,966
Reciprocal7.90535082 × 10^-7≈
Representations
Decimal1,264,966
Binary10011010011010100011021 bits
Octal4646506
Hexadecimal134D46
Base 36R41Y
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and sixty-four thousand, nine hundred and sixty-six
Ordinalone million, two hundred and sixty-four thousand, nine hundred and sixty-sixth
Scientific notation1.264966 × 10^6
Engineering notation1.264966 × 10^6
In other bases
Ternary2101021012121base 3; the most digit-efficient integer base after e: 13 digits
Quinary310434331base 5; one hand: 9 digits
Septenary13515643base 7: 8 digits
Nonary2337177base 9; each digit is two ternary digits: 7 digits
Duodecimal51005abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7i286base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:51:22:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1011T11T0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110101110101011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110100110101000110
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 4d 46
Gray code110101110101111100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110100110101000110
64-bit0000000000000000000000000000000000000000000100110100110101000110
One's complement11111111111011001011001010111001at 32 bits, every bit flipped
Bits reversed01100010101100101100100000000000at 32 bits
Rotated left by 100000000001001101001101010001100at 32 bits, wrapping
Shifted left by 11001101001101010001100= 2,529,932, no wrap
Shifted right by 110011010011010100011= 632,483, discarding the low bit
These bits as a double6.24976244 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,264,966 to the power 21,600,138,981,156
1,264,966 to the power 32,024,121,406,436,980,696
1,264,966 to the power 42,560,444,759,014,961,723,096,336
1,264,966 to the power 53,238,875,565,032,120,071,018,279,764,576
First ten multiples1,264,966, 2,529,932, 3,794,898, 5,059,864, 6,324,830, 7,589,796, 8,854,762, 10,119,728, 11,384,694, 12,649,660
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 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 66
Collatz (3n + 1) trajectory
Steps to reach 1129the total stopping time
Highest value reached2,846,1762× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,264,966 → 632,483 → 1,897,450 → 948,725 → 2,846,176 → 1,423,088 → 711,544 → 355,772 → 177,886 → 88,943 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage126,496,600%
1,264,966% as a decimal12,649.66
1,264,966% of 1001,264,966
1,264,966% of 1,00012,649,660
As a fraction of 1001,264,966/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,264,966
Nerdulate something else
Nothing in mind? Surprise me · today’s page