Nerdulator> put something in

Recognised as Number

65,077

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value65,077
Digit count5
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation59 × 1,103
Distinct prime factors259, 1,103
Number of divisors4
Sum of divisors σ(n)66,240
Aliquot sum1,163sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)63,916integers below n that share no factor with it
Carmichael function λ(n)1,102the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 63,916
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 59, 1,103, 65,0774 in total

Arithmetic

Previous number65,076
Next number65,078
Double130,154
Square root255.101940408≈irrational, shown to 9 decimal places
Cube root40.223128033≈
Negation-65,077
Reciprocal0.0000153664≈

Representations

Decimal65,077
Binary111111100011010116 bits
Octal177065
HexadecimalFE35
Base 361E7P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-five thousand and seventy-seven
Ordinalsixty-five thousand and seventy-seventh
Scientific notation6.5077 × 10^4
Engineering notation65.077 × 10^3

In other bases

Ternary10022021021base 3; the most digit-efficient integer base after e: 11 digits
Quinary4040302base 5; one hand: 7 digits
Septenary360505base 7: 6 digits
Nonary108237base 9; each digit is two ternary digits: 6 digits
Duodecimal317b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal82dhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:4:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1010T1T11T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001001110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111000110101
Bit length16 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits5within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2fe 35
Gray code1000000100101111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111111000110101
32-bit00000000000000001111111000110101
64-bit0000000000000000000000000000000000000000000000001111111000110101
One's complement0000000111001010at 16 bits, every bit flipped
Bits reversed1010110001111111at 16 bits
Rotated left by 11111110001101011at 16 bits, wrapping
Shifted left by 111111110001101010= 130,154, no wrap
Shifted right by 1111111100011010= 32,538, discarding the low bit
These bits as a double3.215231 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime65,089+12
Previous prime65,071−6
Distance to nearest prime6
Nearest square below65,025
Nearest square above65,536

Powers & multiples

65,077 to the power 24,235,015,929
65,077 to the power 3275,602,131,611,533
65,077 to the power 417,935,359,918,883,733,041
65,077 to the power 51,167,179,417,441,196,695,109,157
First ten multiples65,077, 130,154, 195,231, 260,308, 325,385, 390,462, 455,539, 520,616, 585,693, 650,770
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1117the total stopping time
Highest value reached195,2323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps65,077 → 195,232 → 97,616 → 48,808 → 24,404 → 12,202 → 6,101 → 18,304 → 9,152 → 4,576 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,507,700%
65,077% as a decimal650.77
65,077% of 10065,077
65,077% of 1,000650,770
As a fraction of 10065,077/100

Read another way

As bytes63.552 KiB
As a 24-bit colour#00FE35

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 “65077” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.