Nerdulator> put something in

Recognised as Number

65,018

  • Positive
  • Even
  • Composite
  • 5 digits

65,018 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value65,018
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 19 × 29 × 59
Distinct prime factors42, 19, 29, 59
Number of divisors16
Sum of divisors σ(n)108,000
Aliquot sum42,982sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)29,232integers below n that share no factor with it
Carmichael function λ(n)7,308the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 29,232
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 19, 29, 38, 58, 59, 118, 551, 1,102, 1,121, 1,711, 2,242, 3,422, 32,509, 65,01816 in total

Arithmetic

Previous number65,017
Next number65,019
Double130,036
Half32,509
Square root254.98627414≈irrational, shown to 9 decimal places
Cube root40.210968683≈
Negation-65,018
Reciprocal0.0000153804≈

Representations

Decimal65,018
Binary111111011111101016 bits
Octal176772
HexadecimalFDFA
Base 361E62
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-five thousand and eighteen
Ordinalsixty-five thousand and eighteenth
Scientific notation6.5018 × 10^4
Engineering notation65.018 × 10^3

In other bases

Ternary10022012002base 3; the most digit-efficient integer base after e: 11 digits
Quinary4040033base 5; one hand: 7 digits
Septenary360362base 7: 6 digits
Nonary108162base 9; each digit is two ternary digits: 6 digits
Duodecimal31762base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal82aibase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:3:38base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1010T1TT01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001000001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111110111111010
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes2fd fa
Gray code1000001100000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110111111010
32-bit00000000000000001111110111111010
64-bit0000000000000000000000000000000000000000000000001111110111111010
One's complement0000001000000101at 16 bits, every bit flipped
Bits reversed0101111110111111at 16 bits
Rotated left by 11111101111110101at 16 bits, wrapping
Shifted left by 111111101111110100= 130,036, no wrap
Shifted right by 1111111011111101= 32,509, discarding the low bit
These bits as a double3.21231602 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime65,027+9
Previous prime65,011−7
Distance to nearest prime7
Nearest square below64,516
Nearest square above65,025

Powers & multiples

65,018 to the power 24,227,340,324
65,018 to the power 3274,853,213,185,832
65,018 to the power 417,870,406,214,916,424,976
65,018 to the power 51,161,898,071,281,436,119,089,568
First ten multiples65,018, 130,036, 195,054, 260,072, 325,090, 390,108, 455,126, 520,144, 585,162, 650,180
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 8
Divisible by 12No, remainder 2
Divisible by 100No, remainder 18

Collatz (3n + 1) trajectory

Steps to reach 1192the total stopping time
Highest value reached400,9486× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps65,018 → 32,509 → 97,528 → 48,764 → 24,382 → 12,191 → 36,574 → 18,287 → 54,862 → 27,431 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,501,800%
65,018% as a decimal650.18
65,018% of 10065,018
65,018% of 1,000650,180
As a fraction of 10065,018/100

Read another way

As bytes63.494 KiB
As a 24-bit colour#00FDFA

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “65018” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.