Recognised as Number
1,077,122
- Positive
- Even
- Composite
- 7 digits
1,077,122 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,077,122
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 538,561
Distinct prime factors22, 538,561
Number of divisors4
Sum of divisors σ(n)1,615,686
Aliquot sum538,564sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)538,560integers below n that share no factor with it
Carmichael function λ(n)538,560the 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, 538,561, 1,077,1224 in total
Arithmetic
Previous number1,077,121
Next number1,077,123
Double2,154,244
Half538,561
Square1,160,191,802,884
Cube1,249,668,115,106,019,848
Square root1,037.844882437≈irrational, shown to 9 decimal places
Cube root102.507340343≈
Negation-1,077,122
Reciprocal9.2839994 × 10^-7≈
Representations
Decimal1,077,122
Binary10000011011111000001021 bits
Octal4067602
Hexadecimal106F82
Base 36N342
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-seven thousand, one hundred and twenty-two
Ordinalone million, seventy-seven thousand, one hundred and twenty-second
Scientific notation1.077122 × 10^6
Engineering notation1.077122 × 10^6
In other bases
Ternary2000201112102base 3; the most digit-efficient integer base after e: 13 digits
Quinary233431442base 5; one hand: 9 digits
Septenary12104204base 7: 8 digits
Nonary2021472base 9; each digit is two ternary digits: 7 digits
Duodecimal43b402base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6ecg2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:59:12:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T1TTTT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011011000010000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000110111110000010
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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
Bytes310 6f 82
Gray code110000101100001000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000110111110000010
64-bit0000000000000000000000000000000000000000000100000110111110000010
One's complement11111111111011111001000001111101at 32 bits, every bit flipped
Bits reversed01000001111101100000100000000000at 32 bits
Rotated left by 100000000001000001101111100000100at 32 bits, wrapping
Shifted left by 11000001101111100000100= 2,154,244, no wrap
Shifted right by 110000011011111000001= 538,561, discarding the low bit
These bits as a double5.32168977 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,077,122 to the power 21,160,191,802,884
1,077,122 to the power 31,249,668,115,106,019,848
1,077,122 to the power 41,346,045,019,479,226,310,717,456
1,077,122 to the power 51,449,854,703,471,503,202,252,607,641,632
First ten multiples1,077,122, 2,154,244, 3,231,366, 4,308,488, 5,385,610, 6,462,732, 7,539,854, 8,616,976, 9,694,098, 10,771,220
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 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 2
Divisible by 100No, remainder 22
Collatz (3n + 1) trajectory
Steps to reach 1116the total stopping time
Highest value reached1,615,6841× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,077,122 → 538,561 → 1,615,684 → 807,842 → 403,921 → 1,211,764 → 605,882 → 302,941 → 908,824 → 454,412 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,712,200%
1,077,122% as a decimal10,771.22
1,077,122% of 1001,077,122
1,077,122% of 1,00010,771,220
As a fraction of 1001,077,122/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,077,122
Nerdulate something else
Nothing in mind? Surprise me · today’s page