Recognised as Number
-60,301
- Negative
- Odd
- 5 digits
-60,301 is an odd 5-digit integer and the negative of 60,301. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value60,301
Digit count5
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 47 × 1,283
Distinct prime factors247, 1,283
Number of divisors4
Sum of divisors σ(n)61,632
SquarefreeYesno repeated prime factor
All divisors1, 47, 1,283, 60,3014 in total
Arithmetic
Representations
Decimal-60,301
Binary111010111000110116 bits
Octal165615
HexadecimalEB8D
Base 361AJ1
In wordsminus sixty thousand, three hundred and one
Ordinalminus sixty thousand, three hundred and first
Scientific notation-6.0301 × 10^4
Engineering notation-60.301 × 10^3
In other bases
Ternary10001201101base 3; the most digit-efficient integer base after e: 11 digits
Quinary3412201base 5; one hand: 7 digits
Septenary340543base 7: 6 digits
Nonary101641base 9; each digit is two ternary digits: 6 digits
Duodecimal2aa91base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7af1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:45:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT00T110TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110001010110110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110001010001110011
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
Bytes2eb 8d
Gray code1001111001001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110001010001110011two's complement
64-bit1111111111111111111111111111111111111111111111110001010001110011two's complement
One's complement00000000000000001110101110001100at 32 bits, every bit flipped
Bits reversed11001110001010001111111111111111at 32 bits
Rotated left by 111111111111111100010100011100111at 32 bits, wrapping
Shifted left by 1-11101011100011010= -120,602, no wrap
Shifted right by 1-111010111000111= -30,150, discarding the low bit
These bits as a double2.97926525 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-60,301 to the power 23,636,210,601
-60,301 to the power 3-219,267,135,450,901
-60,301 to the power 413,222,027,534,824,781,201
-60,301 to the power 5-797,301,482,377,469,131,201,501
First ten multiples-60,301, -120,602, -180,903, -241,204, -301,505, -361,806, -422,107, -482,408, -542,709, -603,010
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 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-6,030,100%
-60,301% as a decimal-603.01
-60,301% of 100-60,301
-60,301% of 1,000-603,010
As a fraction of 100-60,301/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -60,301
Nerdulate something else
Nothing in mind? Surprise me · today’s page