Recognised as Number
-60,051
- Negative
- Odd
- 5 digits
-60,051 is an odd 5-digit integer and the negative of 60,051. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value60,051
Digit count5
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 37 × 541
Distinct prime factors33, 37, 541
Number of divisors8
Sum of divisors σ(n)82,384
SquarefreeYesno repeated prime factor
All divisors1, 3, 37, 111, 541, 1,623, 20,017, 60,0518 in total
Arithmetic
Representations
Decimal-60,051
Binary111010101001001116 bits
Octal165223
HexadecimalEA93
Base 361AC3
In wordsminus sixty thousand and fifty-one
Ordinalminus sixty thousand and fifty-first
Scientific notation-6.0051 × 10^4
Engineering notation-60.051 × 10^3
In other bases
Ternary10001101010base 3; the most digit-efficient integer base after e: 11 digits
Quinary3410201base 5; one hand: 7 digits
Septenary340035base 7: 6 digits
Nonary101333base 9; each digit is two ternary digits: 6 digits
Duodecimal2a903base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7a2bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:40:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT000TT0T0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110110101010111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110001010101101101
Bit length16 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits7within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2ea 93
Gray code1001111111011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110001010101101101two's complement
64-bit1111111111111111111111111111111111111111111111110001010101101101two's complement
One's complement00000000000000001110101010010010at 32 bits, every bit flipped
Bits reversed10110110101010001111111111111111at 32 bits
Rotated left by 111111111111111100010101011011011at 32 bits, wrapping
Shifted left by 1-11101010100100110= -120,102, no wrap
Shifted right by 1-111010101001010= -30,025, discarding the low bit
These bits as a double2.96691361 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-60,051 to the power 23,606,122,601
-60,051 to the power 3-216,551,268,312,651
-60,051 to the power 413,004,120,213,443,005,201
-60,051 to the power 5-780,910,422,937,465,905,325,251
First ten multiples-60,051, -120,102, -180,153, -240,204, -300,255, -360,306, -420,357, -480,408, -540,459, -600,510
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-6,005,100%
-60,051% as a decimal-600.51
-60,051% of 100-60,051
-60,051% of 1,000-600,510
As a fraction of 100-60,051/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -60,051
Nerdulate something else
Nothing in mind? Surprise me · today’s page