Recognised as Number
77,577
- Positive
- Odd
- Composite
- 5 digits
77,577 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value77,577
Digit count5
Digit sum33
Digit product12,005
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicYesreads the same backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 19 × 1,361
Distinct prime factors33, 19, 1,361
Number of divisors8
Sum of divisors σ(n)108,960
Aliquot sum31,383sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)48,960integers below n that share no factor with it
Carmichael function λ(n)12,240the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 48,960
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 19, 57, 1,361, 4,083, 25,859, 77,5778 in total
Arithmetic
Representations
Decimal77,577
Binary1001011110000100117 bits
Octal227411
Hexadecimal12F09
Base 361NUX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-seven thousand, five hundred and seventy-seven
Ordinalseventy-seven thousand, five hundred and seventy-seventh
Scientific notation7.7577 × 10^4
Engineering notation77.577 × 10^3
In other bases
Ternary10221102020base 3; the most digit-efficient integer base after e: 11 digits
Quinary4440302base 5; one hand: 7 digits
Septenary442113base 7: 6 digits
Nonary127366base 9; each digit is two ternary digits: 6 digits
Duodecimal38a89base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9dihbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:32:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110T111T1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111001100011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010111100001001
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 2f 09
Gray code11011100010001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010111100001001
64-bit0000000000000000000000000000000000000000000000010010111100001001
One's complement11111111111111101101000011110110at 32 bits, every bit flipped
Bits reversed10010000111101001000000000000000at 32 bits
Rotated left by 100000000000000100101111000010010at 32 bits, wrapping
Shifted left by 1100101111000010010= 155,154, no wrap
Shifted right by 11001011110000100= 38,788, discarding the low bit
These bits as a double3.83281306 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
77,577 to the power 26,018,190,929
77,577 to the power 3466,873,197,699,033
77,577 to the power 436,218,622,057,897,883,041
77,577 to the power 52,809,732,043,385,544,072,671,657
First ten multiples77,577, 155,154, 232,731, 310,308, 387,885, 465,462, 543,039, 620,616, 698,193, 775,770
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 77
Collatz (3n + 1) trajectory
Steps to reach 181the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps77,577 → 232,732 → 116,366 → 58,183 → 174,550 → 87,275 → 261,826 → 130,913 → 392,740 → 196,370 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,757,700%
77,577% as a decimal775.77
77,577% of 10077,577
77,577% of 1,000775,770
As a fraction of 10077,577/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 77,577
Nerdulate something else
Nothing in mind? Surprise me · today’s page