Recognised as Number

65,481

Positive
Odd
Composite
5 digits

65,481 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value65,481

Digit count5

Digit sum24

Digit product960

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 13 × 23 × 73

Distinct prime factors43, 13, 23, 73

Number of divisors16

Sum of divisors σ(n)99,456

Aliquot sum33,975sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)792the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,016

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 3, 13, 23, 39, 69, 73, 219, 299, 897, 949, 1,679, 2,847, 5,037, 21,827, 65,48116 in total

Arithmetic

Previous number65,480

Next number65,482

Double130,962

Half32,740.5

Square4,287,761,361

Cube280,766,901,679,641

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

Cube root40.30619185≈

Negation-65,481

Reciprocal0.0000152716≈

Representations

Decimal65,481

Binary111111111100100116 bits

Octal177711

HexadecimalFFC9

Base 361EIX

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

In wordssixty-five thousand, four hundred and eighty-one

Ordinalsixty-five thousand, four hundred and eighty-first

Scientific notation6.5481 × 10^4

Engineering notation65.481 × 10^3

In other bases

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

Quinary4043411base 5; one hand: 7 digits

Septenary361623base 7: 6 digits

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

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

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

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

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

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

Bit-level

1111111111001001

Bit length16 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits4within that length

Bit parityeven12 set bits, so even; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2ff c9

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

At each machine width

16-bit1111111111001001

32-bit00000000000000001111111111001001

64-bit0000000000000000000000000000000000000000000000001111111111001001

One's complement0000000000110110at 16 bits, every bit flipped

Bits reversed1001001111111111at 16 bits

Rotated left by 11111111110010011at 16 bits, wrapping

Shifted left by 111111111110010010= 130,962, no wrap

Shifted right by 1111111111100100= 32,740, discarding the low bit

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

Nearest landmarks

Next prime65,497+16

Previous prime65,479−2

Distance to nearest prime2

Nearest square below65,025

Nearest square above65,536

Powers & multiples

65,481 to the power 24,287,761,361

65,481 to the power 3280,766,901,679,641

65,481 to the power 418,384,897,488,884,572,321

65,481 to the power 51,203,861,472,469,650,680,151,401

First ten multiples65,481, 130,962, 196,443, 261,924, 327,405, 392,886, 458,367, 523,848, 589,329, 654,810

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 9

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time

Highest value reached796,55212× the starting value

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

First steps65,481 → 196,444 → 98,222 → 49,111 → 147,334 → 73,667 → 221,002 → 110,501 → 331,504 → 165,752 → …

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

As a percentage & fraction

As a percentage6,548,100%

65,481% as a decimal654.81

65,481% of 10065,481

65,481% of 1,000654,810

As a fraction of 10065,481/100

Read another way

As seconds18 hours, 11 minutes and 21 seconds

As bytes63.946 KiB

As a 24-bit colour#00FFC9

Keep nerding

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