Recognised as Number

57,340

Positive
Even
Composite
5 digits

57,340 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value57,340

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 factorisation2^2 × 5 × 47 × 61

Distinct prime factors42, 5, 47, 61

Number of divisors24

Sum of divisors σ(n)124,992

Aliquot sum67,652sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)1,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 22,080

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 10, 20, 47, 61, 94, 122, 188, 235, 244, 305, 470, 610, 940, 1,220, 2,867, 5,734, 11,468, 14,335, 28,670, 57,34024 in total

Arithmetic

Previous number57,339

Next number57,341

Double114,680

Half28,670

Square3,287,875,600

Cube188,526,786,904,000

Square root239.457720694≈irrational, shown to 9 decimal places

Cube root38.561379576≈

Negation-57,340

Reciprocal0.0000174398≈

Representations

Decimal57,340

Binary110111111111110016 bits

Octal157774

HexadecimalDFFC

Base 36188S

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

In wordsfifty-seven thousand, three hundred and forty

Ordinalfifty-seven thousand, three hundred and fortieth

Scientific notation5.734 × 10^4

Engineering notation57.34 × 10^3

In other bases

Ternary2220122201base 3; the most digit-efficient integer base after e: 10 digits

Quinary3313330base 5; one hand: 7 digits

Septenary326113base 7: 6 digits

Nonary86581base 9; each digit is two ternary digits: 5 digits

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

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

Sexagesimal15:55:40base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1101111111111100

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 22 trailing zeros

Power of twoNo

Bytes2df fc

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

At each machine width

16-bit1101111111111100

32-bit00000000000000001101111111111100

64-bit0000000000000000000000000000000000000000000000001101111111111100

One's complement0010000000000011at 16 bits, every bit flipped

Bits reversed0011111111111011at 16 bits

Rotated left by 11011111111111001at 16 bits, wrapping

Shifted left by 111011111111111000= 114,680, no wrap

Shifted right by 1110111111111110= 28,670, discarding the low bit

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

Nearest landmarks

Next prime57,347+7

Previous prime57,331−9

Distance to nearest prime7

Nearest square below57,121

Nearest square above57,600

Powers & multiples

57,340 to the power 23,287,875,600

57,340 to the power 3188,526,786,904,000

57,340 to the power 410,810,125,961,075,360,000

57,340 to the power 5619,852,622,608,061,142,400,000

First ten multiples57,340, 114,680, 172,020, 229,360, 286,700, 344,040, 401,380, 458,720, 516,060, 573,400

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 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8No, remainder 4

Divisible by 9No, remainder 1

Divisible by 10Yes

Divisible by 11No, remainder 8

Divisible by 12No, remainder 4

Divisible by 100No, remainder 40

Collatz (3n + 1) trajectory

Steps to reach 1197the total stopping time

Highest value reached2,480,05643× the starting value

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

First steps57,340 → 28,670 → 14,335 → 43,006 → 21,503 → 64,510 → 32,255 → 96,766 → 48,383 → 145,150 → …

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

As a percentage & fraction

As a percentage5,734,000%

57,340% as a decimal573.4

57,340% of 10057,340

57,340% of 1,000573,400

As a fraction of 10057,340/100

Read another way

As seconds15 hours, 55 minutes and 40 seconds

As bytes55.996 KiB

As a 24-bit colour#00DFFC

Keep nerding

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