Recognised as Number
1,077,119
- Positive
- Odd
- Composite
- 7 digits
1,077,119 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,077,119
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation53 × 20,323
Distinct prime factors253, 20,323
Number of divisors4
Sum of divisors σ(n)1,097,496
Aliquot sum20,377sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,056,744integers below n that share no factor with it
Carmichael function λ(n)528,372the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,056,744
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 53, 20,323, 1,077,1194 in total
Arithmetic
Previous number1,077,118
Next number1,077,120
Double2,154,238
Half538,559.5
Square1,160,185,340,161
Cube1,249,657,673,408,876,159
Square root1,037.843437133≈irrational, shown to 9 decimal places
Cube root102.507245175≈
Negation-1,077,119
Reciprocal9.28402526 × 10^-7≈
Representations
Decimal1,077,119
Binary10000011011110111111121 bits
Octal4067577
Hexadecimal106F7F
Base 36N33Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-seven thousand, one hundred and nineteen
Ordinalone million, seventy-seven thousand, one hundred and nineteenth
Scientific notation1.077119 × 10^6
Engineering notation1.077119 × 10^6
In other bases
Ternary2000201112022base 3; the most digit-efficient integer base after e: 13 digits
Quinary233431434base 5; one hand: 9 digits
Septenary12104201base 7: 8 digits
Nonary2021468base 9; each digit is two ternary digits: 7 digits
Duodecimal43b3bbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6ecfjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:59:11:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T1TTTT10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011011000010000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000110111101111111
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 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
Bytes310 6f 7f
Gray code110000101100011000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000110111101111111
64-bit0000000000000000000000000000000000000000000100000110111101111111
One's complement11111111111011111001000010000000at 32 bits, every bit flipped
Bits reversed11111110111101100000100000000000at 32 bits
Rotated left by 100000000001000001101111011111110at 32 bits, wrapping
Shifted left by 11000001101111011111110= 2,154,238, no wrap
Shifted right by 110000011011110111111= 538,559, discarding the low bit
These bits as a double5.32167494 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,077,119 to the power 21,160,185,340,161
1,077,119 to the power 31,249,657,673,408,876,159
1,077,119 to the power 41,346,030,023,524,495,279,505,921
1,077,119 to the power 51,449,834,512,908,680,830,966,138,121,599
First ten multiples1,077,119, 2,154,238, 3,231,357, 4,308,476, 5,385,595, 6,462,714, 7,539,833, 8,616,952, 9,694,071, 10,771,190
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 19
Collatz (3n + 1) trajectory
Steps to reach 1227the total stopping time
Highest value reached36,807,20834× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,077,119 → 3,231,358 → 1,615,679 → 4,847,038 → 2,423,519 → 7,270,558 → 3,635,279 → 10,905,838 → 5,452,919 → 16,358,758 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,711,900%
1,077,119% as a decimal10,771.19
1,077,119% of 1001,077,119
1,077,119% of 1,00010,771,190
As a fraction of 1001,077,119/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,119
Nerdulate something else
Nothing in mind? Surprise me · today’s page