Recognised as Number

57,994

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value57,994

Digit count5

Digit sum34

Digit product11,340

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 × 107 × 271

Distinct prime factors32, 107, 271

Number of divisors8

Sum of divisors σ(n)88,128

Aliquot sum30,134sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,310the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,620

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 107, 214, 271, 542, 28,997, 57,9948 in total

Arithmetic

Previous number57,993

Next number57,995

Double115,988

Half28,997

Square3,363,304,036

Cube195,051,454,263,784

Square root240.819434432≈irrational, shown to 9 decimal places

Cube root38.707431575≈

Negation-57,994

Reciprocal0.0000172432≈

Representations

Decimal57,994

Binary111000101000101016 bits

Octal161212

HexadecimalE28A

Base 3618QY

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

In wordsfifty-seven thousand, nine hundred and ninety-four

Ordinalfifty-seven thousand, nine hundred and ninety-fourth

Scientific notation5.7994 × 10^4

Engineering notation57.994 × 10^3

In other bases

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

Quinary3323434base 5; one hand: 7 digits

Septenary331036base 7: 6 digits

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

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

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

Sexagesimal16:6:34base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110001010001010

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2e2 8a

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

At each machine width

16-bit1110001010001010

32-bit00000000000000001110001010001010

64-bit0000000000000000000000000000000000000000000000001110001010001010

One's complement0001110101110101at 16 bits, every bit flipped

Bits reversed0101000101000111at 16 bits

Rotated left by 11100010100010101at 16 bits, wrapping

Shifted left by 111100010100010100= 115,988, no wrap

Shifted right by 1111000101000101= 28,997, discarding the low bit

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

Nearest landmarks

Next prime58,013+19

Previous prime57,991−3

Distance to nearest prime3

Nearest square below57,600

Nearest square above58,081

Powers & multiples

57,994 to the power 23,363,304,036

57,994 to the power 3195,051,454,263,784

57,994 to the power 411,311,814,038,573,889,296

57,994 to the power 5656,017,343,353,054,135,832,224

First ten multiples57,994, 115,988, 173,982, 231,976, 289,970, 347,964, 405,958, 463,952, 521,946, 579,940

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 4

Divisible by 6No, remainder 4

Divisible by 7No, remainder 6

Divisible by 8No, remainder 2

Divisible by 9No, remainder 7

Divisible by 10No, remainder 4

Divisible by 11No, remainder 2

Divisible by 12No, remainder 10

Divisible by 100No, remainder 94

Collatz (3n + 1) trajectory

Steps to reach 173the total stopping time

Highest value reached86,9921× the starting value

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

First steps57,994 → 28,997 → 86,992 → 43,496 → 21,748 → 10,874 → 5,437 → 16,312 → 8,156 → 4,078 → …

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

As a percentage & fraction

As a percentage5,799,400%

57,994% as a decimal579.94

57,994% of 10057,994

57,994% of 1,000579,940

As a fraction of 10057,994/100

Read another way

As seconds16 hours, 6 minutes and 34 seconds

As bytes56.635 KiB

As a 24-bit colour#00E28A

Keep nerding

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