Recognised as Number
77,931
- Positive
- Odd
- Composite
- 5 digits
77,931 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value77,931
Digit count5
Digit sum27
Digit product1,323
Multiplicative persistence3times 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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 7 × 1,237
Distinct prime factors33, 7, 1,237
Number of divisors12
Sum of divisors σ(n)128,752
Aliquot sum50,821sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)44,496integers below n that share no factor with it
Carmichael function λ(n)1,236the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 44,496
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 63, 1,237, 3,711, 8,659, 11,133, 25,977, 77,93112 in total
Arithmetic
Representations
Decimal77,931
Binary1001100000110101117 bits
Octal230153
Hexadecimal1306B
Base 361O4R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-seven thousand, nine hundred and thirty-one
Ordinalseventy-seven thousand, nine hundred and thirty-first
Scientific notation7.7931 × 10^4
Engineering notation77.931 × 10^3
In other bases
Ternary10221220100base 3; the most digit-efficient integer base after e: 11 digits
Quinary4443211base 5; one hand: 7 digits
Septenary443130base 7: 6 digits
Nonary127810base 9; each digit is two ternary digits: 6 digits
Duodecimal39123base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9egbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:38:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1100T0T0100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111000110111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010011000001101011
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 30 6b
Gray code11010100001011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010011000001101011
64-bit0000000000000000000000000000000000000000000000010011000001101011
One's complement11111111111111101100111110010100at 32 bits, every bit flipped
Bits reversed11010110000011001000000000000000at 32 bits
Rotated left by 100000000000000100110000011010110at 32 bits, wrapping
Shifted left by 1100110000011010110= 155,862, no wrap
Shifted right by 11001100000110101= 38,965, discarding the low bit
These bits as a double3.85030298 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
77,931 to the power 26,073,240,761
77,931 to the power 3473,293,725,745,491
77,931 to the power 436,884,253,341,071,859,121
77,931 to the power 52,874,426,747,123,071,053,158,651
First ten multiples77,931, 155,862, 233,793, 311,724, 389,655, 467,586, 545,517, 623,448, 701,379, 779,310
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1169the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps77,931 → 233,794 → 116,897 → 350,692 → 175,346 → 87,673 → 263,020 → 131,510 → 65,755 → 197,266 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage7,793,100%
77,931% as a decimal779.31
77,931% of 10077,931
77,931% of 1,000779,310
As a fraction of 10077,931/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,931
Nerdulate something else
Nothing in mind? Surprise me · today’s page