Recognised as Number

65,017

Positive
Odd
Composite
5 digits

65,017 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value65,017

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation79 × 823

Distinct prime factors279, 823

Number of divisors4

Sum of divisors σ(n)65,920

Aliquot sum903sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)10,686the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 64,116

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

SquarefreeYesno repeated prime factor

All divisors1, 79, 823, 65,0174 in total

Arithmetic

Previous number65,016

Next number65,018

Double130,034

Half32,508.5

Square4,227,210,289

Cube274,840,531,359,913

Square root254.984313243≈irrational, shown to 9 decimal places

Cube root40.210762528≈

Negation-65,017

Reciprocal0.0000153806≈

Representations

Decimal65,017

Binary111111011111100116 bits

Octal176771

HexadecimalFDF9

Base 361E61

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

In wordssixty-five thousand and seventeen

Ordinalsixty-five thousand and seventeenth

Scientific notation6.5017 × 10^4

Engineering notation65.017 × 10^3

In other bases

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

Quinary4040032base 5; one hand: 7 digits

Septenary360361base 7: 6 digits

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

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

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

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

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

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

Bit-level

1111110111111001

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

Bytes2fd f9

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

At each machine width

16-bit1111110111111001

32-bit00000000000000001111110111111001

64-bit0000000000000000000000000000000000000000000000001111110111111001

One's complement0000001000000110at 16 bits, every bit flipped

Bits reversed1001111110111111at 16 bits

Rotated left by 11111101111110011at 16 bits, wrapping

Shifted left by 111111101111110010= 130,034, no wrap

Shifted right by 1111111011111100= 32,508, discarding the low bit

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

Nearest landmarks

Next prime65,027+10

Previous prime65,011−6

Distance to nearest prime6

Nearest square below64,516

Nearest square above65,025

Powers & multiples

65,017 to the power 24,227,210,289

65,017 to the power 3274,840,531,359,913

65,017 to the power 417,869,306,827,427,463,521

65,017 to the power 51,161,808,721,998,851,395,744,857

First ten multiples65,017, 130,034, 195,051, 260,068, 325,085, 390,102, 455,119, 520,136, 585,153, 650,170

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 17

Collatz (3n + 1) trajectory

Steps to reach 168the total stopping time

Highest value reached246,8683× the starting value

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

First steps65,017 → 195,052 → 97,526 → 48,763 → 146,290 → 73,145 → 219,436 → 109,718 → 54,859 → 164,578 → …

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

As a percentage & fraction

As a percentage6,501,700%

65,017% as a decimal650.17

65,017% of 10065,017

65,017% of 1,000650,170

As a fraction of 10065,017/100

Read another way

As seconds18 hours, 3 minutes and 37 seconds

As bytes63.493 KiB

As a 24-bit colour#00FDF9

Keep nerding

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