Recognised as Number
-30,011
- Negative
- Odd
- 5 digits
-30,011 is an odd 5-digit integer and the negative of 30,011. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value30,011
Digit count5
Digit sum5
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 30,011
Distinct prime factors130,011
Number of divisors2
Sum of divisors σ(n)30,012
SquarefreeYesno repeated prime factor
All divisors1, 30,0112 in total
Arithmetic
Representations
Decimal-30,011
Binary11101010011101115 bits
Octal72473
Hexadecimal753B
Base 36N5N
In wordsminus thirty thousand and eleven
Ordinalminus thirty thousand and eleventh
Scientific notation-3.0011 × 10^4
Engineering notation-30.011 × 10^3
In other bases
Ternary1112011112base 3; the most digit-efficient integer base after e: 10 digits
Quinary1430021base 5; one hand: 7 digits
Septenary153332base 7: 6 digits
Nonary45145base 9; each digit is two ternary digits: 5 digits
Duodecimal1544bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3f0bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:20:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1111T11111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001111111000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000101011000101
Bit length15 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits5within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes275 3b
Gray code100111110100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000101011000101two's complement
32-bit11111111111111111000101011000101two's complement
64-bit1111111111111111111111111111111111111111111111111000101011000101two's complement
One's complement0111010100111010at 16 bits, every bit flipped
Bits reversed1010001101010001at 16 bits
Rotated left by 10001010110001011at 16 bits, wrapping
Shifted left by 1-1110101001110110= -60,022, no wrap
Shifted right by 1-11101010011110= -15,005, discarding the low bit
These bits as a double1.48274041 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-30,011 to the power 2900,660,121
-30,011 to the power 3-27,029,710,891,331
-30,011 to the power 4811,188,653,559,734,641
-30,011 to the power 5-24,344,582,681,981,196,311,051
First ten multiples-30,011, -60,022, -90,033, -120,044, -150,055, -180,066, -210,077, -240,088, -270,099, -300,110
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-3,001,100%
-30,011% as a decimal-300.11
-30,011% of 100-30,011
-30,011% of 1,000-300,110
As a fraction of 100-30,011/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -30,011
Nerdulate something else
Nothing in mind? Surprise me · today’s page