Recognised as Number
1,122,743
- Positive
- Odd
- Composite
- 7 digits
1,122,743 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,122,743
Digit count7
Digit sum20
Digit product336
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation181 × 6,203
Distinct prime factors2181, 6,203
Number of divisors4
Sum of divisors σ(n)1,129,128
Aliquot sum6,385sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,116,360integers below n that share no factor with it
Carmichael function λ(n)558,180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,116,360
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 181, 6,203, 1,122,7434 in total
Arithmetic
Previous number1,122,742
Next number1,122,744
Double2,245,486
Half561,371.5
Square1,260,551,844,049
Cube1,415,275,759,043,106,407
Square root1,059.595677605≈irrational, shown to 9 decimal places
Cube root103.934592749≈
Negation-1,122,743
Reciprocal8.90675782 × 10^-7≈
Representations
Decimal1,122,743
Binary10001001000011011011121 bits
Octal4220667
Hexadecimal1121B7
Base 36O2BB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-two thousand, seven hundred and forty-three
Ordinalone million, one hundred and twenty-two thousand, seven hundred and forty-third
Scientific notation1.122743 × 10^6
Engineering notation1.122743 × 10^6
In other bases
Ternary2010001010002base 3; the most digit-efficient integer base after e: 13 digits
Quinary241411433base 5; one hand: 9 digits
Septenary12354206base 7: 8 digits
Nonary2101102base 9; each digit is two ternary digits: 7 digits
Duodecimal46189bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal706h3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:11:52:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01000101001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010110011011001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010010000110110111
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 21 b7
Gray code110011011000101101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010010000110110111
64-bit0000000000000000000000000000000000000000000100010010000110110111
One's complement11111111111011101101111001001000at 32 bits, every bit flipped
Bits reversed11101101100001001000100000000000at 32 bits
Rotated left by 100000000001000100100001101101110at 32 bits, wrapping
Shifted left by 11000100100001101101110= 2,245,486, no wrap
Shifted right by 110001001000011011011= 561,371, discarding the low bit
These bits as a double5.54708745 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,122,743 to the power 21,260,551,844,049
1,122,743 to the power 31,415,275,759,043,106,407
1,122,743 to the power 41,588,990,951,535,334,416,714,401
1,122,743 to the power 51,784,028,467,899,635,969,025,176,721,943
First ten multiples1,122,743, 2,245,486, 3,368,229, 4,490,972, 5,613,715, 6,736,458, 7,859,201, 8,981,944, 10,104,687, 11,227,430
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1108the total stopping time
Highest value reached7,578,5206× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,122,743 → 3,368,230 → 1,684,115 → 5,052,346 → 2,526,173 → 7,578,520 → 3,789,260 → 1,894,630 → 947,315 → 2,841,946 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,274,300%
1,122,743% as a decimal11,227.43
1,122,743% of 1001,122,743
1,122,743% of 1,00011,227,430
As a fraction of 1001,122,743/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,122,743
Nerdulate something else
Nothing in mind? Surprise me · today’s page