Recognised as Number

77,609

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value77,609

Digit count5

Digit sum29

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 11,087

Distinct prime factors27, 11,087

Number of divisors4

Sum of divisors σ(n)88,704

Aliquot sum11,095sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)33,258the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 66,516

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 11,087, 77,6094 in total

Arithmetic

Previous number77,608

Next number77,610

Double155,218

Half38,804.5

Square6,023,156,881

Cube467,451,182,377,529

Square root278.583919134≈irrational, shown to 9 decimal places

Cube root42.655073619≈

Negation-77,609

Reciprocal0.0000128851≈

Representations

Decimal77,609

Binary1001011110010100117 bits

Octal227451

Hexadecimal12F29

Base 361NVT

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

In wordsseventy-seven thousand, six hundred and nine

Ordinalseventy-seven thousand, six hundred and ninth

Scientific notation7.7609 × 10^4

Engineering notation77.609 × 10^3

In other bases

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

Quinary4440414base 5; one hand: 7 digits

Septenary442160base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010010111100101001

Bit length17 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits8within that length

Bit parityodd9 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 2f 29

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

At each machine width

32-bit00000000000000010010111100101001

64-bit0000000000000000000000000000000000000000000000010010111100101001

One's complement11111111111111101101000011010110at 32 bits, every bit flipped

Bits reversed10010100111101001000000000000000at 32 bits

Rotated left by 100000000000000100101111001010010at 32 bits, wrapping

Shifted left by 1100101111001010010= 155,218, no wrap

Shifted right by 11001011110010100= 38,804, discarding the low bit

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

Nearest landmarks

Next prime77,611+2

Previous prime77,591−18

Distance to nearest prime2

Nearest square below77,284

Nearest square above77,841

Powers & multiples

77,609 to the power 26,023,156,881

77,609 to the power 3467,451,182,377,529

77,609 to the power 436,278,418,813,137,648,161

77,609 to the power 52,815,531,805,668,799,736,127,049

First ten multiples77,609, 155,218, 232,827, 310,436, 388,045, 465,654, 543,263, 620,872, 698,481, 776,090

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 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 4

Divisible by 12No, remainder 5

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time

Highest value reached884,03211× the starting value

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

First steps77,609 → 232,828 → 116,414 → 58,207 → 174,622 → 87,311 → 261,934 → 130,967 → 392,902 → 196,451 → …

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

As a percentage & fraction

As a percentage7,760,900%

77,609% as a decimal776.09

77,609% of 10077,609

77,609% of 1,000776,090

As a fraction of 10077,609/100

Read another way

As seconds21 hours, 33 minutes and 29 seconds

As bytes75.79 KiB

As a 24-bit colour#012F29

Keep nerding

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