Nerdulator> put something in

Recognised as Number

64,028

  • Positive
  • Even
  • Composite
  • 5 digits

64,028 is an even 5-digit integer and a composite number. It has 6 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value64,028
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^2 × 16,007
Distinct prime factors22, 16,007
Number of divisors6
Sum of divisors σ(n)112,056
Aliquot sum48,028sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)32,012integers below n that share no factor with it
Carmichael function λ(n)16,006the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 32,012
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 16,007, 32,014, 64,0286 in total

Arithmetic

Previous number64,027
Next number64,029
Double128,056
Half32,014
Square root253.037546621≈irrational, shown to 9 decimal places
Cube root40.005832483≈
Negation-64,028
Reciprocal0.0000156182≈

Representations

Decimal64,028
Binary111110100001110016 bits
Octal175034
HexadecimalFA1C
Base 361DEK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-four thousand and twenty-eight
Ordinalsixty-four thousand and twenty-eighth
Scientific notation6.4028 × 10^4
Engineering notation64.028 × 10^3

In other bases

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

Bit-level

1111101000011100
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes2fa 1c
Gray code1000011100010010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111101000011100
32-bit00000000000000001111101000011100
64-bit0000000000000000000000000000000000000000000000001111101000011100
One's complement0000010111100011at 16 bits, every bit flipped
Bits reversed0011100001011111at 16 bits
Rotated left by 11111010000111001at 16 bits, wrapping
Shifted left by 111111010000111000= 128,056, no wrap
Shifted right by 1111110100001110= 32,014, discarding the low bit
These bits as a double3.16340352 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime64,033+5
Previous prime64,019−9
Distance to nearest prime5
Nearest square below64,009
Nearest square above64,516

Powers & multiples

64,028 to the power 24,099,584,784
64,028 to the power 3262,488,214,549,952
64,028 to the power 416,806,595,401,204,326,656
64,028 to the power 51,076,092,690,348,310,627,130,368
First ten multiples64,028, 128,056, 192,084, 256,112, 320,140, 384,168, 448,196, 512,224, 576,252, 640,280
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time
Highest value reached108,0521× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps64,028 → 32,014 → 16,007 → 48,022 → 24,011 → 72,034 → 36,017 → 108,052 → 54,026 → 27,013 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,402,800%
64,028% as a decimal640.28
64,028% of 10064,028
64,028% of 1,000640,280
As a fraction of 10064,028/100

Read another way

As bytes62.527 KiB
As a 24-bit colour#00FA1C

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