Recognised as Number
77,130
- Positive
- Even
- Composite
- 5 digits
77,130 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value77,130
Digit count5
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 5 × 857
Distinct prime factors42, 3, 5, 857
Number of divisors24
Sum of divisors σ(n)200,772
Aliquot sum123,642sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)20,544integers below n that share no factor with it
Carmichael function λ(n)2,568the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,544
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 857, 1,714, 2,571, 4,285, 5,142, 7,713, 8,570, 12,855, 15,426, 25,710, 38,565, 77,13024 in total
Arithmetic
Representations
Decimal77,130
Binary1001011010100101017 bits
Octal226512
Hexadecimal12D4A
Base 361NII
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-seven thousand, one hundred and thirty
Ordinalseventy-seven thousand, one hundred and thirtieth
Scientific notation7.713 × 10^4
Engineering notation77.13 × 10^3
In other bases
Ternary10220210200base 3; the most digit-efficient integer base after e: 11 digits
Quinary4432010base 5; one hand: 7 digits
Septenary440604base 7: 6 digits
Nonary126720base 9; each digit is two ternary digits: 6 digits
Duodecimal38776base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9cgabase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:25:30base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110T1T11T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111110101011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010010110101001010
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 even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 2d 4a
Gray code11011101111101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010010110101001010
64-bit0000000000000000000000000000000000000000000000010010110101001010
One's complement11111111111111101101001010110101at 32 bits, every bit flipped
Bits reversed01010010101101001000000000000000at 32 bits
Rotated left by 100000000000000100101101010010100at 32 bits, wrapping
Shifted left by 1100101101010010100= 154,260, no wrap
Shifted right by 11001011010100101= 38,565, discarding the low bit
These bits as a double3.81072833 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
77,130 to the power 25,949,036,900
77,130 to the power 3458,849,216,097,000
77,130 to the power 435,391,040,037,561,610,000
77,130 to the power 52,729,710,918,097,126,979,300,000
First ten multiples77,130, 154,260, 231,390, 308,520, 385,650, 462,780, 539,910, 617,040, 694,170, 771,300
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 4
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 30
Collatz (3n + 1) trajectory
Steps to reach 176the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps77,130 → 38,565 → 115,696 → 57,848 → 28,924 → 14,462 → 7,231 → 21,694 → 10,847 → 32,542 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,713,000%
77,130% as a decimal771.3
77,130% of 10077,130
77,130% of 1,000771,300
As a fraction of 10077,130/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,130
Nerdulate something else
Nothing in mind? Surprise me · today’s page