Recognised as Number

57,995

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value57,995

Digit count5

Digit sum35

Digit product14,175

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 7 × 1,657

Distinct prime factors35, 7, 1,657

Number of divisors8

Sum of divisors σ(n)79,584

Aliquot sum21,589sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,656the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 39,744

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 7, 35, 1,657, 8,285, 11,599, 57,9958 in total

Arithmetic

Previous number57,994

Next number57,996

Double115,990

Half28,997.5

Square3,363,420,025

Cube195,061,544,349,875

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

Cube root38.707654053≈

Negation-57,995

Reciprocal0.0000172429≈

Representations

Decimal57,995

Binary111000101000101116 bits

Octal161213

HexadecimalE28B

Base 3618QZ

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

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

Ordinalfifty-seven thousand, nine hundred and ninety-fifth

Scientific notation5.7995 × 10^4

Engineering notation57.995 × 10^3

In other bases

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

Quinary3323440base 5; one hand: 7 digits

Septenary331040base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110001010001011

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 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

Bytes2e2 8b

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

At each machine width

16-bit1110001010001011

32-bit00000000000000001110001010001011

64-bit0000000000000000000000000000000000000000000000001110001010001011

One's complement0001110101110100at 16 bits, every bit flipped

Bits reversed1101000101000111at 16 bits

Rotated left by 11100010100010111at 16 bits, wrapping

Shifted left by 111100010100010110= 115,990, no wrap

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

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

Nearest landmarks

Next prime58,013+18

Previous prime57,991−4

Distance to nearest prime4

Nearest square below57,600

Nearest square above58,081

Powers & multiples

57,995 to the power 23,363,420,025

57,995 to the power 3195,061,544,349,875

57,995 to the power 411,312,594,264,571,000,625

57,995 to the power 5656,073,904,373,795,181,246,875

First ten multiples57,995, 115,990, 173,985, 231,980, 289,975, 347,970, 405,965, 463,960, 521,955, 579,950

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 3

Divisible by 5Yes

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 5

Divisible by 11No, remainder 3

Divisible by 12No, remainder 11

Divisible by 100No, remainder 95

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time

Highest value reached260,9804× the starting value

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

First steps57,995 → 173,986 → 86,993 → 260,980 → 130,490 → 65,245 → 195,736 → 97,868 → 48,934 → 24,467 → …

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

As a percentage & fraction

As a percentage5,799,500%

57,995% as a decimal579.95

57,995% of 10057,995

57,995% of 1,000579,950

As a fraction of 10057,995/100

Read another way

As seconds16 hours, 6 minutes and 35 seconds

As bytes56.636 KiB

As a 24-bit colour#00E28B

Keep nerding

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