Nerdulator> put something in

Recognised as Number

76,561

  • Positive
  • Odd
  • Prime
  • 5 digits

76,561 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value76,561
Digit count5
Digit sum25
Digit product1,260
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation76,561
Distinct prime factors176,561
Number of divisors2
Sum of divisors σ(n)76,562
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)76,560integers below n that share no factor with it
Carmichael function λ(n)76,560the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 76,5612 in total

Arithmetic

Previous number76,560
Next number76,562
Double153,122
Square root276.696584728≈irrational, shown to 9 decimal places
Cube root42.462203998≈
Negation-76,561
Reciprocal0.0000130615≈

Representations

Decimal76,561
Binary1001010110001000117 bits
Octal225421
Hexadecimal12B11
Base 361N2P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseventy-six thousand, five hundred and sixty-one
Ordinalseventy-six thousand, five hundred and sixty-first
Scientific notation7.6561 × 10^4
Engineering notation76.561 × 10^3

In other bases

Ternary10220000121base 3; the most digit-efficient integer base after e: 11 digits
Quinary4422221base 5; one hand: 7 digits
Septenary436132base 7: 6 digits
Nonary126017base 9; each digit is two ternary digits: 6 digits
Duodecimal38381base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal9b81base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal21:16:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary110T0001TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111111100010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010010101100010001
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 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 2b 11
Gray code11011111010011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010010101100010001
64-bit0000000000000000000000000000000000000000000000010010101100010001
One's complement11111111111111101101010011101110at 32 bits, every bit flipped
Bits reversed10001000110101001000000000000000at 32 bits
Rotated left by 100000000000000100101011000100010at 32 bits, wrapping
Shifted left by 1100101011000100010= 153,122, no wrap
Shifted right by 11001010110001000= 38,280, discarding the low bit
These bits as a double3.78261599 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime76,579+18
Previous prime76,543−18
Distance to nearest prime0, it is prime
Nearest square below76,176
Nearest square above76,729

Powers & multiples

76,561 to the power 25,861,586,721
76,561 to the power 3448,768,940,946,481
76,561 to the power 434,358,198,887,803,531,841
76,561 to the power 52,630,498,065,049,126,201,278,801
First ten multiples76,561, 153,122, 229,683, 306,244, 382,805, 459,366, 535,927, 612,488, 689,049, 765,610
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 181the total stopping time
Highest value reached229,6843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps76,561 → 229,684 → 114,842 → 57,421 → 172,264 → 86,132 → 43,066 → 21,533 → 64,600 → 32,300 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage7,656,100%
76,561% as a decimal765.61
76,561% of 10076,561
76,561% of 1,000765,610
As a fraction of 10076,561/100

Read another way

As bytes74.767 KiB
As a 24-bit colour#012B11

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “76561” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.