Nerdulator> put something in

Recognised as Number

57,328

  • Positive
  • Even
  • Composite
  • 5 digits

57,328 is an even 5-digit integer and a composite number. It has 10 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value57,328
Digit count5
Digit sum25
Digit product1,680
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^4 × 3,583
Distinct prime factors22, 3,583
Number of divisors10
Sum of divisors σ(n)111,104
Aliquot sum53,776sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)28,656integers below n that share no factor with it
Carmichael function λ(n)7,164the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,656
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 3,583, 7,166, 14,332, 28,664, 57,32810 in total

Arithmetic

Previous number57,327
Next number57,329
Double114,656
Half28,664
Square root239.432662768≈irrational, shown to 9 decimal places
Cube root38.558689372≈
Negation-57,328
Reciprocal0.0000174435≈

Representations

Decimal57,328
Binary110111111111000016 bits
Octal157760
HexadecimalDFF0
Base 36188G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-seven thousand, three hundred and twenty-eight
Ordinalfifty-seven thousand, three hundred and twenty-eighth
Scientific notation5.7328 × 10^4
Engineering notation57.328 × 10^3

In other bases

Ternary2220122021base 3; the most digit-efficient integer base after e: 10 digits
Quinary3313303base 5; one hand: 7 digits
Septenary326065base 7: 6 digits
Nonary86567base 9; each digit is two ternary digits: 5 digits
Duodecimal29214base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7368base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal15:55:28base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary100T1T0T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010000000110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101111111110000
Bit length16 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits5within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes2df f0
Gray code1011000000001000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101111111110000
32-bit00000000000000001101111111110000
64-bit0000000000000000000000000000000000000000000000001101111111110000
One's complement0010000000001111at 16 bits, every bit flipped
Bits reversed0000111111111011at 16 bits
Rotated left by 11011111111100001at 16 bits, wrapping
Shifted left by 111011111111100000= 114,656, no wrap
Shifted right by 1110111111111000= 28,664, discarding the low bit
These bits as a double2.83237953 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime57,329+1
Previous prime57,301−27
Distance to nearest prime1
Nearest square below57,121
Nearest square above57,600

Powers & multiples

57,328 to the power 23,286,499,584
57,328 to the power 3188,408,448,151,552
57,328 to the power 410,801,079,515,632,173,056
57,328 to the power 5619,204,286,472,161,216,954,368
First ten multiples57,328, 114,656, 171,984, 229,312, 286,640, 343,968, 401,296, 458,624, 515,952, 573,280
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 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 8
Divisible by 11No, remainder 7
Divisible by 12No, remainder 4
Divisible by 100No, remainder 28

Collatz (3n + 1) trajectory

Steps to reach 1104the total stopping time
Highest value reached275,5604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps57,328 → 28,664 → 14,332 → 7,166 → 3,583 → 10,750 → 5,375 → 16,126 → 8,063 → 24,190 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,732,800%
57,328% as a decimal573.28
57,328% of 10057,328
57,328% of 1,000573,280
As a fraction of 10057,328/100

Read another way

As bytes55.984 KiB
As a 24-bit colour#00DFF0

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