Recognised as Number
-58,741
- Negative
- Odd
- 5 digits
-58,741 is an odd 5-digit integer and the negative of 58,741. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value58,741
Digit count5
Digit sum25
Digit product1,120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 58,741
Distinct prime factors158,741
Number of divisors2
Sum of divisors σ(n)58,742
SquarefreeYesno repeated prime factor
All divisors1, 58,7412 in total
Arithmetic
Representations
Decimal-58,741
Binary111001010111010116 bits
Octal162565
HexadecimalE575
Base 3619BP
In wordsminus fifty-eight thousand, seven hundred and forty-one
Ordinalminus fifty-eight thousand, seven hundred and forty-first
Scientific notation-5.8741 × 10^4
Engineering notation-58.741 × 10^3
In other bases
Ternary2222120121base 3; the most digit-efficient integer base after e: 10 digits
Quinary3334431base 5; one hand: 7 digits
Septenary333154base 7: 6 digits
Nonary88517base 9; each digit is two ternary digits: 5 digits
Duodecimal29bb1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal76h1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:19:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT000011T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110110111110011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110001101010001011
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 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
Bytes2e5 75
Gray code1001011111001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110001101010001011two's complement
64-bit1111111111111111111111111111111111111111111111110001101010001011two's complement
One's complement00000000000000001110010101110100at 32 bits, every bit flipped
Bits reversed11010001010110001111111111111111at 32 bits
Rotated left by 111111111111111100011010100010111at 32 bits, wrapping
Shifted left by 1-11100101011101010= -117,482, no wrap
Shifted right by 1-111001010111011= -29,370, discarding the low bit
These bits as a double2.90219101 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-58,741 to the power 23,450,505,081
-58,741 to the power 3-202,686,118,963,021
-58,741 to the power 411,905,985,314,006,816,561
-58,741 to the power 5-699,369,483,330,074,411,609,701
First ten multiples-58,741, -117,482, -176,223, -234,964, -293,705, -352,446, -411,187, -469,928, -528,669, -587,410
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41
As a percentage & fraction
As a percentage-5,874,100%
-58,741% as a decimal-587.41
-58,741% of 100-58,741
-58,741% of 1,000-587,410
As a fraction of 100-58,741/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -58,741
Nerdulate something else
Nothing in mind? Surprise me · today’s page