Recognised as Number

65,746

Positive
Even
Composite
5 digits

65,746 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value65,746

Digit count5

Digit sum28

Digit product5,040

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 71 × 463

Distinct prime factors32, 71, 463

Number of divisors8

Sum of divisors σ(n)100,224

Aliquot sum34,478sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,310the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 32,340

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 71, 142, 463, 926, 32,873, 65,7468 in total

Arithmetic

Previous number65,745

Next number65,747

Double131,492

Half32,873

Square4,322,536,516

Cube284,189,485,780,936

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

Cube root40.360491389≈

Negation-65,746

Reciprocal0.0000152101≈

Representations

Decimal65,746

Binary1000000001101001017 bits

Octal200322

Hexadecimal100D2

Base 361EQA

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

In wordssixty-five thousand, seven hundred and forty-six

Ordinalsixty-five thousand, seven hundred and forty-sixth

Scientific notation6.5746 × 10^4

Engineering notation65.746 × 10^3

In other bases

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

Quinary4100441base 5; one hand: 7 digits

Septenary362452base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000000011010010

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 even

Highest set bitbit 16worth 65,536

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes301 00 d2

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

At each machine width

32-bit00000000000000010000000011010010

64-bit0000000000000000000000000000000000000000000000010000000011010010

One's complement11111111111111101111111100101101at 32 bits, every bit flipped

Bits reversed01001011000000001000000000000000at 32 bits

Rotated left by 100000000000000100000000110100100at 32 bits, wrapping

Shifted left by 1100000000110100100= 131,492, no wrap

Shifted right by 11000000001101001= 32,873, discarding the low bit

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

Nearest landmarks

Next prime65,761+15

Previous prime65,731−15

Distance to nearest prime15

Nearest square below65,536

Nearest square above66,049

Powers & multiples

65,746 to the power 24,322,536,516

65,746 to the power 3284,189,485,780,936

65,746 to the power 418,684,321,932,153,418,256

65,746 to the power 51,228,419,429,751,358,636,658,976

First ten multiples65,746, 131,492, 197,238, 262,984, 328,730, 394,476, 460,222, 525,968, 591,714, 657,460

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8No, remainder 2

Divisible by 9No, remainder 1

Divisible by 10No, remainder 6

Divisible by 11No, remainder 10

Divisible by 12No, remainder 10

Divisible by 100No, remainder 46

Collatz (3n + 1) trajectory

Steps to reach 1161the total stopping time

Highest value reached249,6403× the starting value

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

First steps65,746 → 32,873 → 98,620 → 49,310 → 24,655 → 73,966 → 36,983 → 110,950 → 55,475 → 166,426 → …

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

As a percentage & fraction

As a percentage6,574,600%

65,746% as a decimal657.46

65,746% of 10065,746

65,746% of 1,000657,460

As a fraction of 10065,746/100

Read another way

As seconds18 hours, 15 minutes and 46 seconds

As bytes64.205 KiB

As a 24-bit colour#0100D2

Keep nerding

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