Recognised as Number

65,362

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value65,362

Digit count5

Digit sum22

Digit product1,080

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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 11 × 2,971

Distinct prime factors32, 11, 2,971

Number of divisors8

Sum of divisors σ(n)106,992

Aliquot sum41,630sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 11, 22, 2,971, 5,942, 32,681, 65,3628 in total

Arithmetic

Previous number65,361

Next number65,363

Double130,724

Half32,681

Square4,272,191,044

Cube279,238,951,017,928

Square root255.659930376≈irrational, shown to 9 decimal places

Cube root40.281760614≈

Negation-65,362

Reciprocal0.0000152994≈

Representations

Decimal65,362

Binary111111110101001016 bits

Octal177522

HexadecimalFF52

Base 361EFM

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

In wordssixty-five thousand, three hundred and sixty-two

Ordinalsixty-five thousand, three hundred and sixty-second

Scientific notation6.5362 × 10^4

Engineering notation65.362 × 10^3

In other bases

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

Quinary4042422base 5; one hand: 7 digits

Septenary361363base 7: 6 digits

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

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

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

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

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

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

Bit-level

1111111101010010

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2ff 52

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

At each machine width

16-bit1111111101010010

32-bit00000000000000001111111101010010

64-bit0000000000000000000000000000000000000000000000001111111101010010

One's complement0000000010101101at 16 bits, every bit flipped

Bits reversed0100101011111111at 16 bits

Rotated left by 11111111010100101at 16 bits, wrapping

Shifted left by 111111111010100100= 130,724, no wrap

Shifted right by 1111111110101001= 32,681, discarding the low bit

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

Nearest landmarks

Next prime65,371+9

Previous prime65,357−5

Distance to nearest prime5

Nearest square below65,025

Nearest square above65,536

Powers & multiples

65,362 to the power 24,272,191,044

65,362 to the power 3279,238,951,017,928

65,362 to the power 418,251,616,316,433,809,936

65,362 to the power 51,192,962,145,674,746,685,036,832

First ten multiples65,362, 130,724, 196,086, 261,448, 326,810, 392,172, 457,534, 522,896, 588,258, 653,620

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 4

Divisible by 10No, remainder 2

Divisible by 11Yes

Divisible by 12No, remainder 10

Divisible by 100No, remainder 62

Collatz (3n + 1) trajectory

Steps to reach 1130the total stopping time

Highest value reached2,417,84836× the starting value

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

First steps65,362 → 32,681 → 98,044 → 49,022 → 24,511 → 73,534 → 36,767 → 110,302 → 55,151 → 165,454 → …

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

As a percentage & fraction

As a percentage6,536,200%

65,362% as a decimal653.62

65,362% of 10065,362

65,362% of 1,000653,620

As a fraction of 10065,362/100

Read another way

As seconds18 hours, 9 minutes and 22 seconds

As bytes63.83 KiB

As a 24-bit colour#00FF52

Keep nerding

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