Recognised as Number

57,341

Positive
Odd
Composite
5 digits

57,341 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value57,341

Digit count5

Digit sum20

Digit product420

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation17 × 3,373

Distinct prime factors217, 3,373

Number of divisors4

Sum of divisors σ(n)60,732

Aliquot sum3,391sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)13,488the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 53,952

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 17, 3,373, 57,3414 in total

Arithmetic

Previous number57,340

Next number57,342

Double114,682

Half28,670.5

Square3,287,990,281

Cube188,536,650,702,821

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

Cube root38.561603742≈

Negation-57,341

Reciprocal0.0000174395≈

Representations

Decimal57,341

Binary110111111111110116 bits

Octal157775

HexadecimalDFFD

Base 36188T

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

In wordsfifty-seven thousand, three hundred and forty-one

Ordinalfifty-seven thousand, three hundred and forty-first

Scientific notation5.7341 × 10^4

Engineering notation57.341 × 10^3

In other bases

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

Quinary3313331base 5; one hand: 7 digits

Septenary326114base 7: 6 digits

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

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

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

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

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

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

Bit-level

1101111111111101

Bit length16 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits2within that length

Bit parityeven14 set bits, so even; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2df fd

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

At each machine width

16-bit1101111111111101

32-bit00000000000000001101111111111101

64-bit0000000000000000000000000000000000000000000000001101111111111101

One's complement0010000000000010at 16 bits, every bit flipped

Bits reversed1011111111111011at 16 bits

Rotated left by 11011111111111011at 16 bits, wrapping

Shifted left by 111011111111111010= 114,682, no wrap

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

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

Nearest landmarks

Next prime57,347+6

Previous prime57,331−10

Distance to nearest prime6

Nearest square below57,121

Nearest square above57,600

Powers & multiples

57,341 to the power 23,287,990,281

57,341 to the power 3188,536,650,702,821

57,341 to the power 410,810,880,087,950,458,961

57,341 to the power 5619,906,675,123,167,267,282,701

First ten multiples57,341, 114,682, 172,023, 229,364, 286,705, 344,046, 401,387, 458,728, 516,069, 573,410

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 5

Divisible by 100No, remainder 41

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,341 → 172,024 → 86,012 → 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,100%

57,341% as a decimal573.41

57,341% of 10057,341

57,341% of 1,000573,410

As a fraction of 10057,341/100

Read another way

As seconds15 hours, 55 minutes and 41 seconds

As bytes55.997 KiB

As a 24-bit colour#00DFFD

Keep nerding

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