Recognised as Number
1,077,124
- Positive
- Even
- Composite
- 7 digits
1,077,124 is an even 7-digit integer and a composite number. It has 6 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,077,124
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 269,281
Distinct prime factors22, 269,281
Number of divisors6
Sum of divisors σ(n)1,884,974
Aliquot sum807,850sum 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)269,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 538,560
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 269,281, 538,562, 1,077,1246 in total
Arithmetic
Previous number1,077,123
Next number1,077,125
Double2,154,248
Half538,562
Square1,160,196,111,376
Cube1,249,675,076,269,762,624
Square root1,037.845845971≈irrational, shown to 9 decimal places
Cube root102.507403788≈
Negation-1,077,124
Reciprocal9.28398216 × 10^-7≈
Representations
Decimal1,077,124
Binary10000011011111000010021 bits
Octal4067604
Hexadecimal106F84
Base 36N344
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-seven thousand, one hundred and twenty-four
Ordinalone million, seventy-seven thousand, one hundred and twenty-fourth
Scientific notation1.077124 × 10^6
Engineering notation1.077124 × 10^6
In other bases
Ternary2000201112111base 3; the most digit-efficient integer base after e: 13 digits
Quinary233431444base 5; one hand: 9 digits
Septenary12104206base 7: 8 digits
Nonary2021474base 9; each digit is two ternary digits: 7 digits
Duodecimal43b404base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6ecg4base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:59:12:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T1TTTT111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011011000010000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000110111110000100
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 22 trailing zeros
Power of twoNo
Bytes310 6f 84
Gray code110000101100001000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000110111110000100
64-bit0000000000000000000000000000000000000000000100000110111110000100
One's complement11111111111011111001000001111011at 32 bits, every bit flipped
Bits reversed00100001111101100000100000000000at 32 bits
Rotated left by 100000000001000001101111100001000at 32 bits, wrapping
Shifted left by 11000001101111100001000= 2,154,248, no wrap
Shifted right by 110000011011111000010= 538,562, discarding the low bit
These bits as a double5.32169965 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,077,124 to the power 21,160,196,111,376
1,077,124 to the power 31,249,675,076,269,762,624
1,077,124 to the power 41,346,055,016,851,991,796,613,376
1,077,124 to the power 51,449,868,163,971,684,811,935,386,010,624
First ten multiples1,077,124, 2,154,248, 3,231,372, 4,308,496, 5,385,620, 6,462,744, 7,539,868, 8,616,992, 9,694,116, 10,771,240
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 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 4
Divisible by 12No, remainder 4
Divisible by 100No, remainder 24
Collatz (3n + 1) trajectory
Steps to reach 1116the total stopping time
Highest value reached1,533,6521× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,077,124 → 538,562 → 269,281 → 807,844 → 403,922 → 201,961 → 605,884 → 302,942 → 151,471 → 454,414 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,712,400%
1,077,124% as a decimal10,771.24
1,077,124% of 1001,077,124
1,077,124% of 1,00010,771,240
As a fraction of 1001,077,124/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,124
Nerdulate something else
Nothing in mind? Surprise me · today’s page