Recognised as Number

77,927

Positive
Odd
Composite
5 digits

77,927 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value77,927

Digit count5

Digit sum32

Digit product6,174

Multiplicative persistence5times the digit product can be taken before one digit is left

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation149 × 523

Distinct prime factors2149, 523

Number of divisors4

Sum of divisors σ(n)78,600

Aliquot sum673sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)77,256integers below n that share no factor with it

Carmichael function λ(n)38,628the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 77,256

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 149, 523, 77,9274 in total

Arithmetic

Previous number77,926

Next number77,928

Double155,854

Half38,963.5

Square6,072,617,329

Cube473,220,850,596,983

Square root279.154079318≈irrational, shown to 9 decimal places

Cube root42.713253422≈

Negation-77,927

Reciprocal0.0000128325≈

Representations

Decimal77,927

Binary1001100000110011117 bits

Octal230147

Hexadecimal13067

Base 361O4N

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsseventy-seven thousand, nine hundred and twenty-seven

Ordinalseventy-seven thousand, nine hundred and twenty-seventh

Scientific notation7.7927 × 10^4

Engineering notation77.927 × 10^3

In other bases

Ternary10221220012base 3; the most digit-efficient integer base after e: 11 digits

Quinary4443202base 5; one hand: 7 digits

Septenary443123base 7: 6 digits

Nonary127805base 9; each digit is two ternary digits: 6 digits

Duodecimal3911bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal9eg7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal21:38:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1100T0T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10111000110111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010011000001100111

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 67

Gray code11010100001010100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010011000001100111

64-bit0000000000000000000000000000000000000000000000010011000001100111

One's complement11111111111111101100111110011000at 32 bits, every bit flipped

Bits reversed11100110000011001000000000000000at 32 bits

Rotated left by 100000000000000100110000011001110at 32 bits, wrapping

Shifted left by 1100110000011001110= 155,854, no wrap

Shifted right by 11001100000110011= 38,963, discarding the low bit

These bits as a double3.85010536 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime77,929+2

Previous prime77,899−28

Distance to nearest prime2

Nearest square below77,841

Nearest square above78,400

Powers & multiples

77,927 to the power 26,072,617,329

77,927 to the power 3473,220,850,596,983

77,927 to the power 436,876,681,224,471,094,241

77,927 to the power 52,873,689,137,779,358,960,918,407

First ten multiples77,927, 155,854, 233,781, 311,708, 389,635, 467,562, 545,489, 623,416, 701,343, 779,270

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 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 7

Divisible by 11No, remainder 3

Divisible by 12No, remainder 11

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1169the total stopping time

Highest value reached1,331,47617× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps77,927 → 233,782 → 116,891 → 350,674 → 175,337 → 526,012 → 263,006 → 131,503 → 394,510 → 197,255 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,792,700%

77,927% as a decimal779.27

77,927% of 10077,927

77,927% of 1,000779,270

As a fraction of 10077,927/100

Read another way

As seconds21 hours, 38 minutes and 47 seconds

As bytes76.101 KiB

As a 24-bit colour#013067

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.