Recognised as Number
1,131,077
- Positive
- Odd
- Prime
- 7 digits
1,131,077 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,131,077
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 factorisation1,131,077
Distinct prime factors11,131,077
Number of divisors2
Sum of divisors σ(n)1,131,078
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,131,076integers below n that share no factor with it
Carmichael function λ(n)1,131,076the 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,131,0772 in total
Arithmetic
Previous number1,131,076
Next number1,131,078
Double2,262,154
Half565,538.5
Square1,279,335,179,929
Cube1,447,026,597,308,553,533
Square root1,063.521038814≈irrational, shown to 9 decimal places
Cube root104.191124142≈
Negation-1,131,077
Reciprocal8.84113106 × 10^-7≈
Representations
Decimal1,131,077
Binary10001010000100100010121 bits
Octal4241105
Hexadecimal114245
Base 36O8QT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and thirty-one thousand and seventy-seven
Ordinalone million, one hundred and thirty-one thousand and seventy-seventh
Scientific notation1.131077 × 10^6
Engineering notation1.131077 × 10^6
In other bases
Ternary2010110112202base 3; the most digit-efficient integer base after e: 13 digits
Quinary242143302base 5; one hand: 9 digits
Septenary12420413base 7: 8 digits
Nonary2113482base 9; each digit is two ternary digits: 7 digits
Duodecimal466685base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal717dhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:14:11:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010111TT0T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010100011001000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010100001001000101
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 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
Bytes311 42 45
Gray code110011110001101100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010100001001000101
64-bit0000000000000000000000000000000000000000000100010100001001000101
One's complement11111111111011101011110110111010at 32 bits, every bit flipped
Bits reversed10100010010000101000100000000000at 32 bits
Rotated left by 100000000001000101000010010001010at 32 bits, wrapping
Shifted left by 11000101000010010001010= 2,262,154, no wrap
Shifted right by 110001010000100100010= 565,538, discarding the low bit
These bits as a double5.58826289 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,131,077 to the power 21,279,335,179,929
1,131,077 to the power 31,447,026,597,308,553,533
1,131,077 to the power 41,636,698,502,603,966,804,445,041
1,131,077 to the power 51,851,232,032,229,786,961,271,283,639,157
First ten multiples1,131,077, 2,262,154, 3,393,231, 4,524,308, 5,655,385, 6,786,462, 7,917,539, 9,048,616, 10,179,693, 11,310,770
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 1178the total stopping time
Highest value reached3,393,2323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,131,077 → 3,393,232 → 1,696,616 → 848,308 → 424,154 → 212,077 → 636,232 → 318,116 → 159,058 → 79,529 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage113,107,700%
1,131,077% as a decimal11,310.77
1,131,077% of 1001,131,077
1,131,077% of 1,00011,310,770
As a fraction of 1001,131,077/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,131,077
Nerdulate something else
Nothing in mind? Surprise me · today’s page