Nerdulator> put something in

Recognised as Number

65,164

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value65,164
Digit count5
Digit sum22
Digit product720
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^2 × 11 × 1,481
Distinct prime factors32, 11, 1,481
Number of divisors12
Sum of divisors σ(n)124,488
Aliquot sum59,324sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)29,600integers below n that share no factor with it
Carmichael function λ(n)1,480the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 29,600
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 44, 1,481, 2,962, 5,924, 16,291, 32,582, 65,16412 in total

Arithmetic

Previous number65,163
Next number65,165
Double130,328
Half32,582
Square root255.272403522≈irrational, shown to 9 decimal places
Cube root40.241044521≈
Negation-65,164
Reciprocal0.0000153459≈

Representations

Decimal65,164
Binary111111101000110016 bits
Octal177214
HexadecimalFE8C
Base 361EA4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-five thousand, one hundred and sixty-four
Ordinalsixty-five thousand, one hundred and sixty-fourth
Scientific notation6.5164 × 10^4
Engineering notation65.164 × 10^3

In other bases

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

Bit-level

1111111010001100
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes2fe 8c
Gray code1000000111001010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111111010001100
32-bit00000000000000001111111010001100
64-bit0000000000000000000000000000000000000000000000001111111010001100
One's complement0000000101110011at 16 bits, every bit flipped
Bits reversed0011000101111111at 16 bits
Rotated left by 11111110100011001at 16 bits, wrapping
Shifted left by 111111110100011000= 130,328, no wrap
Shifted right by 1111111101000110= 32,582, discarding the low bit
These bits as a double3.21952937 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime65,167+3
Previous prime65,147−17
Distance to nearest prime3
Nearest square below65,025
Nearest square above65,536

Powers & multiples

65,164 to the power 24,246,346,896
65,164 to the power 3276,708,949,130,944
65,164 to the power 418,031,461,961,168,834,816
65,164 to the power 51,175,002,187,237,605,951,949,824
First ten multiples65,164, 130,328, 195,492, 260,656, 325,820, 390,984, 456,148, 521,312, 586,476, 651,640
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1161the total stopping time
Highest value reached73,3121× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps65,164 → 32,582 → 16,291 → 48,874 → 24,437 → 73,312 → 36,656 → 18,328 → 9,164 → 4,582 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,516,400%
65,164% as a decimal651.64
65,164% of 10065,164
65,164% of 1,000651,640
As a fraction of 10065,164/100

Read another way

As bytes63.637 KiB
As a 24-bit colour#00FE8C

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 “65164” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.