Recognised as Number

65,213

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value65,213

Digit count5

Digit sum17

Digit product180

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation65,213

Distinct prime factors165,213

Number of divisors2

Sum of divisors σ(n)65,214

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number65,212

Next number65,214

Double130,426

Half32,606.5

Square4,252,735,369

Cube277,333,631,618,597

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

Cube root40.251128397≈

Negation-65,213

Reciprocal0.0000153344≈

Representations

Decimal65,213

Binary111111101011110116 bits

Octal177275

HexadecimalFEBD

Base 361EBH

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

In wordssixty-five thousand, two hundred and thirteen

Ordinalsixty-five thousand, two hundred and thirteenth

Scientific notation6.5213 × 10^4

Engineering notation65.213 × 10^3

In other bases

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

Quinary4041323base 5; one hand: 7 digits

Septenary361061base 7: 6 digits

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

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

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

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

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

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

Bit-level

1111111010111101

Bit length16 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits3within that length

Bit parityodd13 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 bd

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

At each machine width

16-bit1111111010111101

32-bit00000000000000001111111010111101

64-bit0000000000000000000000000000000000000000000000001111111010111101

One's complement0000000101000010at 16 bits, every bit flipped

Bits reversed1011110101111111at 16 bits

Rotated left by 11111110101111011at 16 bits, wrapping

Shifted left by 111111110101111010= 130,426, no wrap

Shifted right by 1111111101011110= 32,606, discarding the low bit

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

Nearest landmarks

Next prime65,239+26

Previous prime65,203−10

Distance to nearest prime0, it is prime

Nearest square below65,025

Nearest square above65,536

Powers & multiples

65,213 to the power 24,252,735,369

65,213 to the power 3277,333,631,618,597

65,213 to the power 418,085,758,118,743,566,161

65,213 to the power 51,179,426,544,197,624,180,057,293

First ten multiples65,213, 130,426, 195,639, 260,852, 326,065, 391,278, 456,491, 521,704, 586,917, 652,130

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

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 1

Divisible by 8No, remainder 5

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 1161the total stopping time

Highest value reached195,6403× the starting value

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

First steps65,213 → 195,640 → 97,820 → 48,910 → 24,455 → 73,366 → 36,683 → 110,050 → 55,025 → 165,076 → …

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

As a percentage & fraction

As a percentage6,521,300%

65,213% as a decimal652.13

65,213% of 10065,213

65,213% of 1,000652,130

As a fraction of 10065,213/100

Read another way

As seconds18 hours, 6 minutes and 53 seconds

As bytes63.685 KiB

As a 24-bit colour#00FEBD

Keep nerding

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