Recognised as Number

65,731

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value65,731

Digit count5

Digit sum22

Digit product630

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation65,731

Distinct prime factors165,731

Number of divisors2

Sum of divisors σ(n)65,732

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number65,730

Next number65,732

Double131,462

Half32,865.5

Square4,320,564,361

Cube283,995,016,012,891

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

Cube root40.35742173≈

Negation-65,731

Reciprocal0.0000152135≈

Representations

Decimal65,731

Binary1000000001100001117 bits

Octal200303

Hexadecimal100C3

Base 361EPV

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

In wordssixty-five thousand, seven hundred and thirty-one

Ordinalsixty-five thousand, seven hundred and thirty-first

Scientific notation6.5731 × 10^4

Engineering notation65.731 × 10^3

In other bases

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

Quinary4100411base 5; one hand: 7 digits

Septenary362431base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000000011000011

Bit length17 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits12within that length

Bit parityodd5 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 00 c3

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

At each machine width

32-bit00000000000000010000000011000011

64-bit0000000000000000000000000000000000000000000000010000000011000011

One's complement11111111111111101111111100111100at 32 bits, every bit flipped

Bits reversed11000011000000001000000000000000at 32 bits

Rotated left by 100000000000000100000000110000110at 32 bits, wrapping

Shifted left by 1100000000110000110= 131,462, no wrap

Shifted right by 11000000001100001= 32,865, discarding the low bit

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

Nearest landmarks

Next prime65,761+30

Previous prime65,729−2

Distance to nearest prime0, it is prime

Nearest square below65,536

Nearest square above66,049

Powers & multiples

65,731 to the power 24,320,564,361

65,731 to the power 3283,995,016,012,891

65,731 to the power 418,667,276,397,543,338,321

65,731 to the power 51,227,018,744,886,921,171,177,651

First ten multiples65,731, 131,462, 197,193, 262,924, 328,655, 394,386, 460,117, 525,848, 591,579, 657,310

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 7

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 199the total stopping time

Highest value reached899,58413× the starting value

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

First steps65,731 → 197,194 → 98,597 → 295,792 → 147,896 → 73,948 → 36,974 → 18,487 → 55,462 → 27,731 → …

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

As a percentage & fraction

As a percentage6,573,100%

65,731% as a decimal657.31

65,731% of 10065,731

65,731% of 1,000657,310

As a fraction of 10065,731/100

Read another way

As seconds18 hours, 15 minutes and 31 seconds

As bytes64.19 KiB

As a 24-bit colour#0100C3

Keep nerding

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