Recognised as Number
-30,000,003
- Negative
- Odd
- 8 digits
-30,000,003 is an odd 8-digit integer and the negative of 30,000,003. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value30,000,003
Digit count8
Digit sum6
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicYesreads the same backwards
Factors & divisors
Prime factorisation−1 × 3 × 11 × 909,091
Distinct prime factors33, 11, 909,091
Number of divisors8
Sum of divisors σ(n)43,636,416
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 909,091, 2,727,273, 10,000,001, 30,000,0038 in total
Arithmetic
Previous number-30,000,004
Next number-30,000,002
Double-60,000,006
Half-15,000,001.5
Square900,000,180,000,009
Cube-27,000,008,100,000,810,000,027
Cube root-310.723260953≈
Negation30,000,003
Reciprocal-3.333333 × 10^-8≈
Representations
Decimal-30,000,003
Binary111001001110000111000001125 bits
Octal162341603
Hexadecimal1C9C383
Base 36HV05F
In wordsminus thirty million and three
Ordinalminus thirty million and third
Scientific notation-3.0000003 × 10^7
Engineering notation-30.000003 × 10^6
In other bases
Ternary2002110011021020base 3; the most digit-efficient integer base after e: 16 digits
Quinary30140000003base 5; one hand: 11 digits
Septenary512665365base 7: 9 digits
Nonary62404236base 9; each digit is two ternary digits: 8 digits
Duodecimala069143base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal97a003base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal2:18:53:20:3base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT10T1TT00TTT1TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010010100100110110001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111110001101100011110001111101
Bit length25 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits13within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 24worth 16,777,216
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes401 c9 c3 83
Gray code1001011010010001001000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111110001101100011110001111101two's complement
64-bit1111111111111111111111111111111111111110001101100011110001111101two's complement
One's complement00000001110010011100001110000010at 32 bits, every bit flipped
Bits reversed10111110001111000110110001111111at 32 bits
Rotated left by 111111100011011000111100011111011at 32 bits, wrapping
Shifted left by 1-11100100111000011100000110= -60,000,006, no wrap
Shifted right by 1-111001001110000111000010= -15,000,001, discarding the low bit
These bits as a double1.48219709 × 10^-316≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-30,000,003 to the power 2900,000,180,000,009
-30,000,003 to the power 3-27,000,008,100,000,810,000,027
-30,000,003 to the power 4810,000,324,000,048,600,003,240,000,081
-30,000,003 to the power 5-24,300,012,150,002,430,000,243,000,012,150,000,243
First ten multiples-30,000,003, -60,000,006, -90,000,009, -120,000,012, -150,000,015, -180,000,018, -210,000,021, -240,000,024, -270,000,027, -300,000,030
Powers of twoBetween 2^24 (16,777,216) and 2^25 (33,554,432)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 3
As a percentage & fraction
As a percentage-3,000,000,300%
-30,000,003% as a decimal-300,000.03
-30,000,003% of 100-30,000,003
-30,000,003% of 1,000-300,000,030
As a fraction of 100-30,000,003/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -30,000,003
Also reads as
30000003 (identifier)
- 8 characters
- Checksum fails
30000003 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page