Recognised as Number
1,126,681
- Positive
- Odd
- Composite
- 7 digits
1,126,681 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,126,681
Digit count7
Digit sum25
Digit product576
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 factorisation19^2 × 3,121
Distinct prime factors219, 3,121
Number of divisors6
Sum of divisors σ(n)1,189,482
Aliquot sum62,801sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,067,040integers below n that share no factor with it
Carmichael function λ(n)177,840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,067,040
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 19, 361, 3,121, 59,299, 1,126,6816 in total
Arithmetic
Previous number1,126,680
Next number1,126,682
Double2,253,362
Half563,340.5
Square1,269,410,075,761
Cube1,430,220,213,568,479,241
Square root1,061.452306983≈irrational, shown to 9 decimal places
Cube root104.055967164≈
Negation-1,126,681
Reciprocal8.87562673 × 10^-7≈
Representations
Decimal1,126,681
Binary10001001100010001100121 bits
Octal4230431
Hexadecimal113119
Base 36O5CP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-six thousand, six hundred and eighty-one
Ordinalone million, one hundred and twenty-six thousand, six hundred and eighty-first
Scientific notation1.126681 × 10^6
Engineering notation1.126681 × 10^6
In other bases
Ternary2010020111221base 3; the most digit-efficient integer base after e: 13 digits
Quinary242023211base 5; one hand: 9 digits
Septenary12401533base 7: 8 digits
Nonary2106457base 9; each digit is two ternary digits: 7 digits
Duodecimal464021base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal70ge1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:12:58:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T1TTT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010111000101101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010011000100011001
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 31 19
Gray code110011010100110010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010011000100011001
64-bit0000000000000000000000000000000000000000000100010011000100011001
One's complement11111111111011101100111011100110at 32 bits, every bit flipped
Bits reversed10011000100011001000100000000000at 32 bits
Rotated left by 100000000001000100110001000110010at 32 bits, wrapping
Shifted left by 11000100110001000110010= 2,253,362, no wrap
Shifted right by 110001001100010001100= 563,340, discarding the low bit
These bits as a double5.56654376 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,126,681 to the power 21,269,410,075,761
1,126,681 to the power 31,430,220,213,568,479,241
1,126,681 to the power 41,611,401,940,443,547,759,729,121
1,126,681 to the power 51,815,535,949,660,876,833,479,365,777,401
First ten multiples1,126,681, 2,253,362, 3,380,043, 4,506,724, 5,633,405, 6,760,086, 7,886,767, 9,013,448, 10,140,129, 11,266,810
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1328the total stopping time
Highest value reached7,234,3246× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,126,681 → 3,380,044 → 1,690,022 → 845,011 → 2,535,034 → 1,267,517 → 3,802,552 → 1,901,276 → 950,638 → 475,319 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,668,100%
1,126,681% as a decimal11,266.81
1,126,681% of 1001,126,681
1,126,681% of 1,00011,266,810
As a fraction of 1001,126,681/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,126,681
Nerdulate something else
Nothing in mind? Surprise me · today’s page