Recognised as Number
1,077,127
- Positive
- Odd
- Prime
- 7 digits
1,077,127 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,077,127
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation1,077,127
Distinct prime factors11,077,127
Number of divisors2
Sum of divisors σ(n)1,077,128
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,077,126integers below n that share no factor with it
Carmichael function λ(n)1,077,126the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,077,1272 in total
Arithmetic
Previous number1,077,126
Next number1,077,128
Double2,154,254
Half538,563.5
Square1,160,202,574,129
Cube1,249,685,518,063,847,383
Square root1,037.847291272≈irrational, shown to 9 decimal places
Cube root102.507498956≈
Negation-1,077,127
Reciprocal9.2839563 × 10^-7≈
Representations
Decimal1,077,127
Binary10000011011111000011121 bits
Octal4067607
Hexadecimal106F87
Base 36N347
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-seven thousand, one hundred and twenty-seven
Ordinalone million, seventy-seven thousand, one hundred and twenty-seventh
Scientific notation1.077127 × 10^6
Engineering notation1.077127 × 10^6
In other bases
Ternary2000201112121base 3; the most digit-efficient integer base after e: 13 digits
Quinary233432002base 5; one hand: 9 digits
Septenary12104212base 7: 8 digits
Nonary2021477base 9; each digit is two ternary digits: 7 digits
Duodecimal43b407base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6ecg7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:59:12:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T1TTT0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011011000010011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000110111110000111
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; 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 87
Gray code110000101100001000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000110111110000111
64-bit0000000000000000000000000000000000000000000100000110111110000111
One's complement11111111111011111001000001111000at 32 bits, every bit flipped
Bits reversed11100001111101100000100000000000at 32 bits
Rotated left by 100000000001000001101111100001110at 32 bits, wrapping
Shifted left by 11000001101111100001110= 2,154,254, no wrap
Shifted right by 110000011011111000011= 538,563, discarding the low bit
These bits as a double5.32171447 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,077,127 to the power 21,160,202,574,129
1,077,127 to the power 31,249,685,518,063,847,383
1,077,127 to the power 41,346,070,013,015,557,740,108,641
1,077,127 to the power 51,449,888,354,909,408,661,930,000,154,407
First ten multiples1,077,127, 2,154,254, 3,231,381, 4,308,508, 5,385,635, 6,462,762, 7,539,889, 8,617,016, 9,694,143, 10,771,270
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 27
Collatz (3n + 1) trajectory
Steps to reach 1116the total stopping time
Highest value reached7,270,6126× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,077,127 → 3,231,382 → 1,615,691 → 4,847,074 → 2,423,537 → 7,270,612 → 3,635,306 → 1,817,653 → 5,452,960 → 2,726,480 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,712,700%
1,077,127% as a decimal10,771.27
1,077,127% of 1001,077,127
1,077,127% of 1,00010,771,270
As a fraction of 1001,077,127/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,127
Nerdulate something else
Nothing in mind? Surprise me · today’s page