Recognised as Number
77,129
- Positive
- Odd
- Composite
- 5 digits
77,129 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value77,129
Digit count5
Digit sum26
Digit product882
Multiplicative persistence4times 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 factorisation13 × 17 × 349
Distinct prime factors313, 17, 349
Number of divisors8
Sum of divisors σ(n)88,200
Aliquot sum11,071sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)66,816integers below n that share no factor with it
Carmichael function λ(n)1,392the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 66,816
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 17, 221, 349, 4,537, 5,933, 77,1298 in total
Arithmetic
Representations
Decimal77,129
Binary1001011010100100117 bits
Octal226511
Hexadecimal12D49
Base 361NIH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-seven thousand, one hundred and twenty-nine
Ordinalseventy-seven thousand, one hundred and twenty-ninth
Scientific notation7.7129 × 10^4
Engineering notation77.129 × 10^3
In other bases
Ternary10220210122base 3; the most digit-efficient integer base after e: 11 digits
Quinary4432004base 5; one hand: 7 digits
Septenary440603base 7: 6 digits
Nonary126718base 9; each digit is two ternary digits: 6 digits
Duodecimal38775base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9cg9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:25:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110T1T11T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111110101011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010110101001001
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 2d 49
Gray code11011101111101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010110101001001
64-bit0000000000000000000000000000000000000000000000010010110101001001
One's complement11111111111111101101001010110110at 32 bits, every bit flipped
Bits reversed10010010101101001000000000000000at 32 bits
Rotated left by 100000000000000100101101010010010at 32 bits, wrapping
Shifted left by 1100101101010010010= 154,258, no wrap
Shifted right by 11001011010100100= 38,564, discarding the low bit
These bits as a double3.81067892 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
77,129 to the power 25,948,882,641
77,129 to the power 3458,831,369,217,689
77,129 to the power 435,389,204,676,391,134,881
77,129 to the power 52,729,533,967,485,371,842,236,649
First ten multiples77,129, 154,258, 231,387, 308,516, 385,645, 462,774, 539,903, 617,032, 694,161, 771,290
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1161the total stopping time
Highest value reached3,166,50441× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps77,129 → 231,388 → 115,694 → 57,847 → 173,542 → 86,771 → 260,314 → 130,157 → 390,472 → 195,236 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,712,900%
77,129% as a decimal771.29
77,129% of 10077,129
77,129% of 1,000771,290
As a fraction of 10077,129/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,129
Nerdulate something else
Nothing in mind? Surprise me · today’s page