Recognised as Number

65,993

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value65,993

Digit count5

Digit sum32

Digit product7,290

Multiplicative persistence2times 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 factorisation65,993

Distinct prime factors165,993

Number of divisors2

Sum of divisors σ(n)65,994

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)65,992the 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, 65,9932 in total

Arithmetic

Previous number65,992

Next number65,994

Double131,986

Half32,996.5

Square4,355,076,049

Cube287,404,533,701,657

Square root256.891027481≈irrational, shown to 9 decimal places

Cube root40.410971434≈

Negation-65,993

Reciprocal0.0000151531≈

Representations

Decimal65,993

Binary1000000011100100117 bits

Octal200711

Hexadecimal101C9

Base 361EX5

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

In wordssixty-five thousand, nine hundred and ninety-three

Ordinalsixty-five thousand, nine hundred and ninety-third

Scientific notation6.5993 × 10^4

Engineering notation65.993 × 10^3

In other bases

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

Quinary4102433base 5; one hand: 7 digits

Septenary363254base 7: 6 digits

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

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

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

Sexagesimal18:19:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

00000000000000010000000111001001

Bit length17 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits11within that length

Bit parityeven6 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 01 c9

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

At each machine width

32-bit00000000000000010000000111001001

64-bit0000000000000000000000000000000000000000000000010000000111001001

One's complement11111111111111101111111000110110at 32 bits, every bit flipped

Bits reversed10010011100000001000000000000000at 32 bits

Rotated left by 100000000000000100000001110010010at 32 bits, wrapping

Shifted left by 1100000001110010010= 131,986, no wrap

Shifted right by 11000000011100100= 32,996, discarding the low bit

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

Nearest landmarks

Next prime66,029+36

Previous prime65,983−10

Distance to nearest prime0, it is prime

Nearest square below65,536

Nearest square above66,049

Powers & multiples

65,993 to the power 24,355,076,049

65,993 to the power 3287,404,533,701,657

65,993 to the power 418,966,687,392,573,450,401

65,993 to the power 51,251,668,601,098,099,712,313,193

First ten multiples65,993, 131,986, 197,979, 263,972, 329,965, 395,958, 461,951, 527,944, 593,937, 659,930

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 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 4

Divisible by 12No, remainder 5

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 1117the total stopping time

Highest value reached334,0965× the starting value

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

First steps65,993 → 197,980 → 98,990 → 49,495 → 148,486 → 74,243 → 222,730 → 111,365 → 334,096 → 167,048 → …

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

As a percentage & fraction

As a percentage6,599,300%

65,993% as a decimal659.93

65,993% of 10065,993

65,993% of 1,000659,930

As a fraction of 10065,993/100

Read another way

As seconds18 hours, 19 minutes and 53 seconds

As bytes64.446 KiB

As a 24-bit colour#0101C9

Keep nerding

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