Recognised as Number

77,151

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value77,151

Digit count5

Digit sum21

Digit product245

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 25,717

Distinct prime factors23, 25,717

Number of divisors4

Sum of divisors σ(n)102,872

Aliquot sum25,721sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)25,716the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 51,432

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 25,717, 77,1514 in total

Arithmetic

Previous number77,150

Next number77,152

Double154,302

Half38,575.5

Square5,952,276,801

Cube459,224,107,473,951

Square root277.760688363≈irrational, shown to 9 decimal places

Cube root42.571000122≈

Negation-77,151

Reciprocal0.0000129616≈

Representations

Decimal77,151

Binary1001011010101111117 bits

Octal226537

Hexadecimal12D5F

Base 361NJ3

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

In wordsseventy-seven thousand, one hundred and fifty-one

Ordinalseventy-seven thousand, one hundred and fifty-first

Scientific notation7.7151 × 10^4

Engineering notation77.151 × 10^3

In other bases

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

Quinary4432101base 5; one hand: 7 digits

Septenary440634base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010010110101011111

Bit length17 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits6within that length

Bit parityodd11 set bits, so odd; 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 5f

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

At each machine width

32-bit00000000000000010010110101011111

64-bit0000000000000000000000000000000000000000000000010010110101011111

One's complement11111111111111101101001010100000at 32 bits, every bit flipped

Bits reversed11111010101101001000000000000000at 32 bits

Rotated left by 100000000000000100101101010111110at 32 bits, wrapping

Shifted left by 1100101101010111110= 154,302, no wrap

Shifted right by 11001011010101111= 38,575, discarding the low bit

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

Nearest landmarks

Next prime77,153+2

Previous prime77,141−10

Distance to nearest prime2

Nearest square below76,729

Nearest square above77,284

Powers & multiples

77,151 to the power 25,952,276,801

77,151 to the power 3459,224,107,473,951

77,151 to the power 435,429,599,115,722,793,601

77,151 to the power 52,733,429,001,377,129,249,110,751

First ten multiples77,151, 154,302, 231,453, 308,604, 385,755, 462,906, 540,057, 617,208, 694,359, 771,510

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 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 1

Divisible by 11No, remainder 8

Divisible by 12No, remainder 3

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1169the total stopping time

Highest value reached1,171,74415× the starting value

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

First steps77,151 → 231,454 → 115,727 → 347,182 → 173,591 → 520,774 → 260,387 → 781,162 → 390,581 → 1,171,744 → …

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

As a percentage & fraction

As a percentage7,715,100%

77,151% as a decimal771.51

77,151% of 10077,151

77,151% of 1,000771,510

As a fraction of 10077,151/100

Read another way

As seconds21 hours, 25 minutes and 51 seconds

As bytes75.343 KiB

As a 24-bit colour#012D5F

Keep nerding

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