Recognised as Number
-10,043,767
- Negative
- Odd
- 8 digits
-10,043,767 is an odd 8-digit integer and the negative of 10,043,767. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,043,767
Digit count8
Digit sum28
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 × 10,043,767
Distinct prime factors110,043,767
Number of divisors2
Sum of divisors σ(n)10,043,768
SquarefreeYesno repeated prime factor
All divisors1, 10,043,7672 in total
Arithmetic
Previous number-10,043,768
Next number-10,043,766
Double-20,087,534
Half-5,021,883.5
Square100,877,255,550,289
Cube-1,013,187,650,346,559,498,663
Cube root-215.757322044≈
Negation10,043,767
Reciprocal-9.95642372 × 10^-8≈
Representations
Decimal-10,043,767
Binary10011001010000010111011124 bits
Octal46240567
Hexadecimal994177
Base 365Z9TJ
In wordsminus ten million, forty-three thousand, seven hundred and sixty-seven
Ordinalminus ten million, forty-three thousand, seven hundred and sixty-seventh
Scientific notation-1.0043767 × 10^7
Engineering notation-10.043767 × 10^6
In other bases
Ternary200220021110101base 3; the most digit-efficient integer base after e: 15 digits
Quinary10032400032base 5; one hand: 11 digits
Septenary151241056base 7: 9 digits
Nonary20807411base 9; each digit is two ternary digits: 8 digits
Duodecimal3444447base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32f987base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:29:56:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T010T1TTT0T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110111100001110011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111011001101011111010001001
Bit length24 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits12within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes399 41 77
Gray code110101011110000111001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111011001101011111010001001two's complement
64-bit1111111111111111111111111111111111111111011001101011111010001001two's complement
One's complement00000000100110010100000101110110at 32 bits, every bit flipped
Bits reversed10010001011111010110011011111111at 32 bits
Rotated left by 111111110110011010111110100010011at 32 bits, wrapping
Shifted left by 1-1001100101000001011101110= -20,087,534, no wrap
Shifted right by 1-10011001010000010111100= -5,021,883, discarding the low bit
These bits as a double4.96228023 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-10,043,767 to the power 2100,877,255,550,289
-10,043,767 to the power 3-1,013,187,650,346,559,498,663
-10,043,767 to the power 410,176,220,687,358,312,856,207,983,521
-10,043,767 to the power 5-102,207,589,524,406,739,840,857,490,024,763,607
First ten multiples-10,043,767, -20,087,534, -30,131,301, -40,175,068, -50,218,835, -60,262,602, -70,306,369, -80,350,136, -90,393,903, -100,437,670
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-1,004,376,700%
-10,043,767% as a decimal-100,437.67
-10,043,767% of 100-10,043,767
-10,043,767% of 1,000-100,437,670
As a fraction of 100-10,043,767/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -10,043,767
Also reads as
10043767 (identifier)
- 8 characters
- Checksum fails
10043767 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